./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN --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 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:35:23,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:35:23,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:35:23,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:35:23,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:35:23,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:35:23,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:35:23,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:35:23,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:35:23,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:35:23,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:35:23,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:35:23,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:35:23,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:35:23,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:35:23,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:35:23,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:35:23,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:35:23,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:35:23,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:35:23,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:35:23,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:35:23,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:35:23,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:35:23,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:35:23,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:35:23,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:35:23,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:35:23,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:35:23,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:35:23,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:35:23,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:35:23,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:35:23,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:35:23,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:35:23,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:35:23,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:35:23,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:35:23,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:35:23,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:35:23,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:35:23,634 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:35:23,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:35:23,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:35:23,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:35:23,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:35:23,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:35:23,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:35:23,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:35:23,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:35:23,691 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:35:23,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:35:23,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:35:23,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:35:23,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:35:23,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:35:23,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:35:23,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:35:23,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:35:23,710 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:35:23,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:35:23,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:35:23,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:35:23,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:35:23,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:35:23,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:35:23,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:23,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:35:23,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:35:23,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:35:23,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:35:23,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:35:23,714 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:35:23,714 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:35:23,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:35:23,714 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_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/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_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN 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 -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 [2022-11-20 12:35:24,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:35:24,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:35:24,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:35:24,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:35:24,066 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:35:24,068 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-20 12:35:27,696 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:35:27,922 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:35:27,923 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-20 12:35:27,932 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/data/fc14dbe30/09d90ecce074460bbd9a5d4ab9c31b10/FLAG599de54bc [2022-11-20 12:35:27,956 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/data/fc14dbe30/09d90ecce074460bbd9a5d4ab9c31b10 [2022-11-20 12:35:27,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:35:27,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:35:27,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:27,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:35:27,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:35:27,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:27" (1/1) ... [2022-11-20 12:35:27,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533c1fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:27, skipping insertion in model container [2022-11-20 12:35:27,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:35:27" (1/1) ... [2022-11-20 12:35:27,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:35:28,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:35:28,223 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-20 12:35:28,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:28,257 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:35:28,276 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-20 12:35:28,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:35:28,302 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:35:28,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28 WrapperNode [2022-11-20 12:35:28,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:35:28,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:28,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:35:28,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:35:28,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,348 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-20 12:35:28,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:35:28,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:35:28,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:35:28,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:35:28,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:35:28,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:35:28,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:35:28,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:35:28,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (1/1) ... [2022-11-20 12:35:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:35:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:28,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:35:28,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:35:28,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:35:28,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:35:28,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:35:28,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:35:28,590 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:35:28,592 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:35:28,744 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:35:28,751 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:35:28,752 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:35:28,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:28 BoogieIcfgContainer [2022-11-20 12:35:28,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:35:28,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:35:28,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:35:28,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:35:28,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:35:27" (1/3) ... [2022-11-20 12:35:28,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3f9011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:28, skipping insertion in model container [2022-11-20 12:35:28,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:35:28" (2/3) ... [2022-11-20 12:35:28,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3f9011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:35:28, skipping insertion in model container [2022-11-20 12:35:28,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:35:28" (3/3) ... [2022-11-20 12:35:28,767 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-11-20 12:35:28,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:35:28,793 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:35:28,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:35:28,866 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@712c4b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:35:28,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:35:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:35:28,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:28,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:35:28,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:28,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-20 12:35:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:28,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218615337] [2022-11-20 12:35:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:29,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218615337] [2022-11-20 12:35:29,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218615337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:29,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:29,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:35:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713405932] [2022-11-20 12:35:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:29,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:35:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:35:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:35:29,125 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:29,142 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-20 12:35:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:35:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 12:35:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:29,154 INFO L225 Difference]: With dead ends: 21 [2022-11-20 12:35:29,155 INFO L226 Difference]: Without dead ends: 9 [2022-11-20 12:35:29,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:35:29,165 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:29,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:35:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-20 12:35:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-20 12:35:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-20 12:35:29,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-20 12:35:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:29,211 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-20 12:35:29,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-20 12:35:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:35:29,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:29,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:35:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:35:29,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-20 12:35:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:29,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734318978] [2022-11-20 12:35:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:29,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:29,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734318978] [2022-11-20 12:35:29,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734318978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:35:29,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:35:29,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:35:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211196965] [2022-11-20 12:35:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:35:29,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:35:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:35:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:35:29,534 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:29,567 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-20 12:35:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:35:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 12:35:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:29,569 INFO L225 Difference]: With dead ends: 19 [2022-11-20 12:35:29,569 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 12:35:29,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:35:29,572 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:29,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:35:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 12:35:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-20 12:35:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-20 12:35:29,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-20 12:35:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:29,578 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-20 12:35:29,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-20 12:35:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 12:35:29,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:29,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:29,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:35:29,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-20 12:35:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:29,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108372049] [2022-11-20 12:35:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:29,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:29,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108372049] [2022-11-20 12:35:29,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108372049] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:29,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707907709] [2022-11-20 12:35:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:29,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:29,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:29,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:30,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:35:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:30,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:35:30,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:30,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:30,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707907709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:30,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:30,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-11-20 12:35:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987363774] [2022-11-20 12:35:30,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:30,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:35:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:30,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:35:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:35:30,441 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:30,562 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-20 12:35:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:35:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 12:35:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:30,564 INFO L225 Difference]: With dead ends: 26 [2022-11-20 12:35:30,564 INFO L226 Difference]: Without dead ends: 19 [2022-11-20 12:35:30,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:35:30,567 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:30,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:35:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-20 12:35:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-20 12:35:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-20 12:35:30,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-11-20 12:35:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:30,576 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-20 12:35:30,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-20 12:35:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:35:30,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:30,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:30,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:35:30,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-20 12:35:30,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-20 12:35:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:30,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815887046] [2022-11-20 12:35:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:31,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815887046] [2022-11-20 12:35:31,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815887046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:31,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562102618] [2022-11-20 12:35:31,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:35:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:31,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:31,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:35:31,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:35:31,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:35:31,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 12:35:31,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:31,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:32,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562102618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:32,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:32,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 20 [2022-11-20 12:35:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718524672] [2022-11-20 12:35:32,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:32,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 12:35:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 12:35:32,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:35:32,180 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:35,701 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-11-20 12:35:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:35:35,702 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:35:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:35,704 INFO L225 Difference]: With dead ends: 57 [2022-11-20 12:35:35,705 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 12:35:35,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 12:35:35,707 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:35,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 25 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:35:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 12:35:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-11-20 12:35:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-20 12:35:35,721 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-11-20 12:35:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:35,721 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-20 12:35:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-20 12:35:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 12:35:35,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:35,723 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:35,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:35:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:35,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1843997196, now seen corresponding path program 1 times [2022-11-20 12:35:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:35,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222118649] [2022-11-20 12:35:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222118649] [2022-11-20 12:35:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222118649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:36,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914926086] [2022-11-20 12:35:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:36,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:36,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:36,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:35:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:36,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 12:35:36,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:36,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:36,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914926086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:36,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:36,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-20 12:35:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977007800] [2022-11-20 12:35:36,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:36,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 12:35:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 12:35:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:35:36,645 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:37,463 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-20 12:35:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:35:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 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 24 [2022-11-20 12:35:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:37,469 INFO L225 Difference]: With dead ends: 60 [2022-11-20 12:35:37,469 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 12:35:37,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:35:37,470 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:37,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:35:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 12:35:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-20 12:35:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-20 12:35:37,487 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 24 [2022-11-20 12:35:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:37,487 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-20 12:35:37,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-20 12:35:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 12:35:37,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:37,491 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:37,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 12:35:37,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:37,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-11-20 12:35:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357795843] [2022-11-20 12:35:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357795843] [2022-11-20 12:35:38,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357795843] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665333704] [2022-11-20 12:35:38,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:35:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:38,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:38,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:35:38,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:35:38,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:35:38,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 12:35:38,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-20 12:35:38,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-20 12:35:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665333704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:39,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2022-11-20 12:35:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467303806] [2022-11-20 12:35:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:39,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 12:35:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 12:35:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:35:39,057 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:35:40,104 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-20 12:35:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:35:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 12:35:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:35:40,106 INFO L225 Difference]: With dead ends: 57 [2022-11-20 12:35:40,106 INFO L226 Difference]: Without dead ends: 53 [2022-11-20 12:35:40,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 12:35:40,108 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:35:40,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:35:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-20 12:35:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-20 12:35:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-20 12:35:40,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 36 [2022-11-20 12:35:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:35:40,123 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-20 12:35:40,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:35:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-20 12:35:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 12:35:40,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:35:40,125 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 12:35:40,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:35:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:40,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:35:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:35:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -749374373, now seen corresponding path program 2 times [2022-11-20 12:35:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:35:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145905661] [2022-11-20 12:35:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:35:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:35:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:35:40,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:40,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145905661] [2022-11-20 12:35:40,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145905661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:40,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979049906] [2022-11-20 12:35:40,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:35:40,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:40,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:40,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:40,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:35:40,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:35:40,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:35:41,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 12:35:41,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:41,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:35:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979049906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:42,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:42,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 33 [2022-11-20 12:35:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617866213] [2022-11-20 12:35:42,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 12:35:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 12:35:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=740, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 12:35:42,120 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:06,143 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-11-20 12:36:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 12:36:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 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 51 [2022-11-20 12:36:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:06,146 INFO L225 Difference]: With dead ends: 121 [2022-11-20 12:36:06,146 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 12:36:06,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=778, Invalid=1384, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 12:36:06,148 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:06,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:36:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 12:36:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-20 12:36:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-11-20 12:36:06,169 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 51 [2022-11-20 12:36:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:06,170 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-11-20 12:36:06,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-11-20 12:36:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 12:36:06,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:06,174 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 30, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:06,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:36:06,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:06,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:36:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1404636997, now seen corresponding path program 3 times [2022-11-20 12:36:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842661134] [2022-11-20 12:36:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 245 proven. 1365 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:36:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:08,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842661134] [2022-11-20 12:36:08,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842661134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:36:08,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018317766] [2022-11-20 12:36:08,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:36:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:36:08,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:36:08,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:36:08,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-20 12:36:08,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:36:08,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:36:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:36:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 326 proven. 15 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-20 12:36:09,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:36:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-20 12:36:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018317766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:36:11,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:36:11,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 11] total 49 [2022-11-20 12:36:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443153124] [2022-11-20 12:36:11,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:36:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-20 12:36:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-20 12:36:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2006, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 12:36:11,312 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:36:18,723 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2022-11-20 12:36:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-20 12:36:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 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 105 [2022-11-20 12:36:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:36:18,725 INFO L225 Difference]: With dead ends: 146 [2022-11-20 12:36:18,726 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 12:36:18,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1203, Invalid=6279, Unknown=0, NotChecked=0, Total=7482 [2022-11-20 12:36:18,729 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 252 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:36:18,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 53 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-20 12:36:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 12:36:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-11-20 12:36:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2022-11-20 12:36:18,750 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 105 [2022-11-20 12:36:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:36:18,751 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2022-11-20 12:36:18,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:36:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-11-20 12:36:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-20 12:36:18,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:36:18,754 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 32, 9, 1, 1, 1, 1, 1, 1] [2022-11-20 12:36:18,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:36:18,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:18,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:36:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:36:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 674089979, now seen corresponding path program 4 times [2022-11-20 12:36:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:36:18,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68396135] [2022-11-20 12:36:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:36:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:36:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:36:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 849 proven. 1552 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-20 12:36:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:36:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68396135] [2022-11-20 12:36:20,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68396135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:36:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588690158] [2022-11-20 12:36:20,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:36:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:36:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:36:20,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:36:20,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdeda8f0-2529-4001-8f4b-53619bb5ab51/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:36:21,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:36:21,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:36:21,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-20 12:36:21,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:36:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 12:36:21,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:36:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 12:36:26,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588690158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:36:26,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:36:26,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 37] total 72 [2022-11-20 12:36:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073780496] [2022-11-20 12:36:26,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:36:26,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 12:36:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:36:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 12:36:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=3712, Unknown=0, NotChecked=0, Total=5112 [2022-11-20 12:36:26,224 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 72 states, 72 states have (on average 2.986111111111111) internal successors, (215), 72 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:37:31,824 WARN L233 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 239 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:38:43,261 WARN L233 SmtUtils]: Spent 15.02s on a formula simplification. DAG size of input: 232 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:38:45,296 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30)))) is different from false [2022-11-20 12:38:47,313 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29)))) is different from false [2022-11-20 12:39:40,940 WARN L233 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 215 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:39:43,009 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29)))) is different from false [2022-11-20 12:40:42,088 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 236 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:40:44,100 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29)))) is different from false [2022-11-20 12:40:46,117 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32)))) is different from false [2022-11-20 12:41:47,750 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 211 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:42:50,862 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 204 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:42:52,928 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse3)) (< 4294967294 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26)))) is different from false [2022-11-20 12:43:44,766 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 187 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:44:35,590 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 187 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:45:38,226 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 190 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:46:33,664 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 183 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:47:35,179 WARN L233 SmtUtils]: Spent 9.15s on a formula simplification. DAG size of input: 176 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:48:25,757 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 169 DAG size of output: 12 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)