./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro --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 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- 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-8393723 [2022-11-18 19:53:52,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:53:52,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:53:52,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:53:52,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:53:52,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:53:52,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:53:52,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:53:52,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:53:52,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:53:52,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:53:52,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:53:52,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:53:52,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:53:52,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:53:52,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:53:52,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:53:52,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:53:52,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:53:52,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:53:52,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:53:52,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:53:52,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:53:52,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:53:52,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:53:52,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:53:52,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:53:52,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:53:52,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:53:52,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:53:52,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:53:52,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:53:52,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:53:52,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:53:52,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:53:52,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:53:52,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:53:52,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:53:52,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:53:52,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:53:52,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:53:52,474 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:53:52,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:53:52,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:53:52,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:53:52,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:53:52,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:53:52,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:53:52,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:53:52,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:53:52,518 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:53:52,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:53:52,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:53:52,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:53:52,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:53:52,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:53:52,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:53:52,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:53:52,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:53:52,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:53:52,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:53:52,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:53:52,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:53:52,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:53:52,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:53:52,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:53:52,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:52,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:53:52,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:53:52,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:53:52,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:53:52,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:53:52,525 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:53:52,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:53:52,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:53:52,525 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_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/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_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro 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 -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2022-11-18 19:53:52,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:53:52,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:53:52,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:53:52,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:53:52,844 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:53:52,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-18 19:53:52,911 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/data/dec7f77f6/a779f5e7ffd841e69996647bb89dc201/FLAG732001909 [2022-11-18 19:53:53,624 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:53:53,624 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-18 19:53:53,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/data/dec7f77f6/a779f5e7ffd841e69996647bb89dc201/FLAG732001909 [2022-11-18 19:53:53,795 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/data/dec7f77f6/a779f5e7ffd841e69996647bb89dc201 [2022-11-18 19:53:53,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:53:53,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:53:53,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:53,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:53:53,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:53:53,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:53" (1/1) ... [2022-11-18 19:53:53,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1048be49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:53, skipping insertion in model container [2022-11-18 19:53:53,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:53" (1/1) ... [2022-11-18 19:53:53,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:53:53,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:53:54,169 WARN L234 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_fae91806-7304-4853-8915-d569e5bf06d7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-18 19:53:54,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:54,708 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:53:54,730 WARN L234 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_fae91806-7304-4853-8915-d569e5bf06d7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-18 19:53:55,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:55,122 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:53:55,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55 WrapperNode [2022-11-18 19:53:55,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:55,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:55,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:53:55,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:53:55,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,382 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-18 19:53:55,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:55,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:53:55,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:53:55,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:53:55,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,526 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:53:55,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:53:55,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:53:55,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:53:55,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (1/1) ... [2022-11-18 19:53:55,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:55,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:55,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:53:55,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:53:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:53:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:53:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:53:55,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:53:55,787 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:53:55,789 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:53:59,227 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:53:59,239 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:53:59,239 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 19:53:59,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:59 BoogieIcfgContainer [2022-11-18 19:53:59,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:53:59,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:53:59,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:53:59,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:53:59,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:53:53" (1/3) ... [2022-11-18 19:53:59,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1076fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:59, skipping insertion in model container [2022-11-18 19:53:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:55" (2/3) ... [2022-11-18 19:53:59,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1076fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:59, skipping insertion in model container [2022-11-18 19:53:59,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:59" (3/3) ... [2022-11-18 19:53:59,252 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2022-11-18 19:53:59,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:53:59,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:53:59,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:53:59,376 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;@1e260917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:53:59,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:53:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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-18 19:53:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 19:53:59,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:59,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:59,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:53:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2022-11-18 19:53:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:59,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128439806] [2022-11-18 19:53:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:59,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:59,863 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-18 19:53:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128439806] [2022-11-18 19:53:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128439806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:59,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:59,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:53:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698348057] [2022-11-18 19:53:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:59,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:53:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:53:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:53:59,920 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-18 19:54:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:02,330 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-18 19:54:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:02,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-18 19:54:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:02,347 INFO L225 Difference]: With dead ends: 1155 [2022-11-18 19:54:02,348 INFO L226 Difference]: Without dead ends: 667 [2022-11-18 19:54:02,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 19:54:02,355 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 308 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:02,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-18 19:54:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-18 19:54:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-18 19:54:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 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-18 19:54:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-18 19:54:02,427 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 36 [2022-11-18 19:54:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:02,427 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-18 19:54:02,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-18 19:54:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-18 19:54:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-18 19:54:02,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:02,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:02,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:54:02,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 532908861, now seen corresponding path program 1 times [2022-11-18 19:54:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:02,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387332088] [2022-11-18 19:54:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:02,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387332088] [2022-11-18 19:54:02,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387332088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:02,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:02,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818336237] [2022-11-18 19:54:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:02,710 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-18 19:54:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:05,523 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-18 19:54:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2022-11-18 19:54:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:05,530 INFO L225 Difference]: With dead ends: 1953 [2022-11-18 19:54:05,530 INFO L226 Difference]: Without dead ends: 1290 [2022-11-18 19:54:05,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 19:54:05,534 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:05,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-18 19:54:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-18 19:54:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-18 19:54:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 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-18 19:54:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-18 19:54:05,579 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 111 [2022-11-18 19:54:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:05,587 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-18 19:54:05,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-18 19:54:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-18 19:54:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-18 19:54:05,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:05,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:05,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:54:05,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1986106637, now seen corresponding path program 1 times [2022-11-18 19:54:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187532154] [2022-11-18 19:54:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:05,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187532154] [2022-11-18 19:54:05,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187532154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:05,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:05,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:05,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909475741] [2022-11-18 19:54:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:05,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:05,825 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-18 19:54:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:08,493 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-18 19:54:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2022-11-18 19:54:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:08,505 INFO L225 Difference]: With dead ends: 3764 [2022-11-18 19:54:08,506 INFO L226 Difference]: Without dead ends: 2484 [2022-11-18 19:54:08,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 19:54:08,518 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:08,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 19:54:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-18 19:54:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-18 19:54:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 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-18 19:54:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-18 19:54:08,574 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 115 [2022-11-18 19:54:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:08,576 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-18 19:54:08,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-18 19:54:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-18 19:54:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-18 19:54:08,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:08,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:08,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:54:08,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1703382585, now seen corresponding path program 1 times [2022-11-18 19:54:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:08,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762194225] [2022-11-18 19:54:08,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:08,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-18 19:54:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:08,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762194225] [2022-11-18 19:54:08,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762194225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:08,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:08,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597162651] [2022-11-18 19:54:08,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:08,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:08,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:08,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:08,991 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-18 19:54:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:11,042 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-18 19:54:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 206 [2022-11-18 19:54:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:11,055 INFO L225 Difference]: With dead ends: 6166 [2022-11-18 19:54:11,055 INFO L226 Difference]: Without dead ends: 3986 [2022-11-18 19:54:11,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 19:54:11,059 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:11,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 19:54:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-18 19:54:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-18 19:54:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 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-18 19:54:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-18 19:54:11,143 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 206 [2022-11-18 19:54:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:11,145 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-18 19:54:11,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-18 19:54:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-18 19:54:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-18 19:54:11,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:11,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:11,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:54:11,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2135107277, now seen corresponding path program 1 times [2022-11-18 19:54:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121432871] [2022-11-18 19:54:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-18 19:54:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121432871] [2022-11-18 19:54:12,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121432871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:12,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:12,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918838532] [2022-11-18 19:54:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:12,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:12,082 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-18 19:54:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:14,191 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-18 19:54:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 308 [2022-11-18 19:54:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:14,204 INFO L225 Difference]: With dead ends: 7661 [2022-11-18 19:54:14,204 INFO L226 Difference]: Without dead ends: 3981 [2022-11-18 19:54:14,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 19:54:14,209 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:14,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 19:54:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-18 19:54:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-18 19:54:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 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-18 19:54:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-18 19:54:14,289 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 308 [2022-11-18 19:54:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:14,290 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-18 19:54:14,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-18 19:54:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-18 19:54:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-11-18 19:54:14,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:14,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:14,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:54:14,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:14,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1741911394, now seen corresponding path program 1 times [2022-11-18 19:54:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:14,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770087993] [2022-11-18 19:54:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 19:54:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770087993] [2022-11-18 19:54:14,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770087993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:14,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:14,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536470004] [2022-11-18 19:54:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:14,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:14,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:14,695 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-18 19:54:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:16,954 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-18 19:54:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 323 [2022-11-18 19:54:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:16,972 INFO L225 Difference]: With dead ends: 9465 [2022-11-18 19:54:16,972 INFO L226 Difference]: Without dead ends: 5785 [2022-11-18 19:54:16,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:16,979 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 280 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:16,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-18 19:54:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-18 19:54:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-18 19:54:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.1675890695261155) internal successors, (6751), 5782 states have internal predecessors, (6751), 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-18 19:54:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-18 19:54:17,167 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 323 [2022-11-18 19:54:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:17,168 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-18 19:54:17,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-18 19:54:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-18 19:54:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-11-18 19:54:17,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:17,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:54:17,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1792802591, now seen corresponding path program 1 times [2022-11-18 19:54:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813317501] [2022-11-18 19:54:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 19:54:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:17,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813317501] [2022-11-18 19:54:17,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813317501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:17,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:17,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714636375] [2022-11-18 19:54:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:17,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:17,566 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-18 19:54:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:19,697 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-18 19:54:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 382 [2022-11-18 19:54:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:19,720 INFO L225 Difference]: With dead ends: 13364 [2022-11-18 19:54:19,720 INFO L226 Difference]: Without dead ends: 7882 [2022-11-18 19:54:19,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:19,726 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 291 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:19,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 19:54:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-18 19:54:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-18 19:54:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148702457778388) internal successors, (8366), 7283 states have internal predecessors, (8366), 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-18 19:54:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-18 19:54:19,861 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 382 [2022-11-18 19:54:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:19,862 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-18 19:54:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-18 19:54:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-18 19:54:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-11-18 19:54:19,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:19,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:19,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:54:19,871 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 746313456, now seen corresponding path program 1 times [2022-11-18 19:54:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:19,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977079561] [2022-11-18 19:54:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 19:54:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:20,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977079561] [2022-11-18 19:54:20,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977079561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:20,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:20,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212451958] [2022-11-18 19:54:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:20,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:20,305 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-18 19:54:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:22,550 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-18 19:54:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 397 [2022-11-18 19:54:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:22,587 INFO L225 Difference]: With dead ends: 16069 [2022-11-18 19:54:22,587 INFO L226 Difference]: Without dead ends: 9086 [2022-11-18 19:54:22,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:22,595 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 293 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:22,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-18 19:54:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-18 19:54:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-18 19:54:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1379716981132075) internal successors, (9650), 8480 states have internal predecessors, (9650), 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-18 19:54:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-18 19:54:22,743 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 397 [2022-11-18 19:54:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:22,744 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-18 19:54:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-18 19:54:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-18 19:54:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2022-11-18 19:54:22,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:22,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:22,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:54:22,756 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 843512261, now seen corresponding path program 1 times [2022-11-18 19:54:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520577744] [2022-11-18 19:54:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-18 19:54:23,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:23,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520577744] [2022-11-18 19:54:23,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520577744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:23,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:23,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525770625] [2022-11-18 19:54:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:23,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:23,232 INFO L87 Difference]: Start difference. First operand 8481 states and 9650 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-18 19:54:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:25,747 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-18 19:54:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:25,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 487 [2022-11-18 19:54:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:25,767 INFO L225 Difference]: With dead ends: 19651 [2022-11-18 19:54:25,767 INFO L226 Difference]: Without dead ends: 11471 [2022-11-18 19:54:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:25,774 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:25,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 19:54:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-18 19:54:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-18 19:54:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1486076283489508) internal successors, (8703), 7577 states have internal predecessors, (8703), 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-18 19:54:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-18 19:54:25,901 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 487 [2022-11-18 19:54:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:25,902 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-18 19:54:25,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-18 19:54:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-18 19:54:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2022-11-18 19:54:25,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:25,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:25,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:54:25,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1011437163, now seen corresponding path program 1 times [2022-11-18 19:54:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:25,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027494021] [2022-11-18 19:54:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:25,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 477 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-11-18 19:54:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:26,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027494021] [2022-11-18 19:54:26,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027494021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:26,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244840020] [2022-11-18 19:54:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:26,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:26,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:26,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:26,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:54:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:27,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 19:54:27,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-18 19:54:27,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:54:27,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244840020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:27,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:54:27,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 19:54:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283202015] [2022-11-18 19:54:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:27,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:27,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:27,160 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-18 19:54:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:29,454 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-18 19:54:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 520 [2022-11-18 19:54:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:29,483 INFO L225 Difference]: With dead ends: 17246 [2022-11-18 19:54:29,483 INFO L226 Difference]: Without dead ends: 9969 [2022-11-18 19:54:29,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:29,492 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 381 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:29,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-18 19:54:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-18 19:54:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-18 19:54:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.1499799357945426) internal successors, (11463), 9968 states have internal predecessors, (11463), 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-18 19:54:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-18 19:54:29,646 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 520 [2022-11-18 19:54:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:29,647 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-18 19:54:29,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-18 19:54:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-18 19:54:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2022-11-18 19:54:29,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:29,653 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:29,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:29,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:29,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1710037215, now seen corresponding path program 1 times [2022-11-18 19:54:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344644555] [2022-11-18 19:54:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-18 19:54:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344644555] [2022-11-18 19:54:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344644555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465134178] [2022-11-18 19:54:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:30,615 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-18 19:54:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:33,112 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-18 19:54:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 524 [2022-11-18 19:54:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:33,138 INFO L225 Difference]: With dead ends: 24136 [2022-11-18 19:54:33,139 INFO L226 Difference]: Without dead ends: 14468 [2022-11-18 19:54:33,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:33,147 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:33,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 19:54:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-18 19:54:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-18 19:54:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1348449530267712) internal successors, (16066), 14157 states have internal predecessors, (16066), 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-18 19:54:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-18 19:54:33,420 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 524 [2022-11-18 19:54:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:33,421 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-18 19:54:33,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-18 19:54:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-18 19:54:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-11-18 19:54:33,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:33,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:54:33,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash -531161142, now seen corresponding path program 1 times [2022-11-18 19:54:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275791288] [2022-11-18 19:54:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 634 proven. 39 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-11-18 19:54:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:34,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275791288] [2022-11-18 19:54:34,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275791288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:34,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836705308] [2022-11-18 19:54:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:34,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:34,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:54:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:34,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 19:54:34,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-18 19:54:34,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:54:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836705308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:34,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:54:34,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 19:54:34,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755054801] [2022-11-18 19:54:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:34,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:34,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:34,759 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-18 19:54:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:36,806 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-18 19:54:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:36,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 599 [2022-11-18 19:54:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:36,835 INFO L225 Difference]: With dead ends: 27712 [2022-11-18 19:54:36,835 INFO L226 Difference]: Without dead ends: 13855 [2022-11-18 19:54:36,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:36,845 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:36,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-18 19:54:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-18 19:54:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-18 19:54:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 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-18 19:54:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-18 19:54:37,089 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 599 [2022-11-18 19:54:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:37,091 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-18 19:54:37,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-18 19:54:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-18 19:54:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2022-11-18 19:54:37,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:37,104 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:37,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:37,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:37,312 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1926565044, now seen corresponding path program 1 times [2022-11-18 19:54:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:37,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310519833] [2022-11-18 19:54:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 19:54:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:38,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310519833] [2022-11-18 19:54:38,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310519833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:38,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918674986] [2022-11-18 19:54:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:38,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:38,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:54:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:38,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:54:38,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 19:54:39,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 19:54:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918674986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:40,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-18 19:54:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542453772] [2022-11-18 19:54:40,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:40,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:54:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:40,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:54:40,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:54:40,445 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-18 19:54:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:48,685 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-18 19:54:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:54:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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 600 [2022-11-18 19:54:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:48,712 INFO L225 Difference]: With dead ends: 35741 [2022-11-18 19:54:48,712 INFO L226 Difference]: Without dead ends: 16247 [2022-11-18 19:54:48,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1194 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:54:48,722 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2894 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5609 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 5609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:48,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2894 Valid, 242 Invalid, 6257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 5609 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-18 19:54:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-18 19:54:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-18 19:54:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0386047264486888) internal successors, (12833), 12356 states have internal predecessors, (12833), 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-18 19:54:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-18 19:54:48,903 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 600 [2022-11-18 19:54:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:48,903 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-18 19:54:48,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-18 19:54:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-18 19:54:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2022-11-18 19:54:48,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:48,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:48,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:49,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:49,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash 366324416, now seen corresponding path program 1 times [2022-11-18 19:54:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:49,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100293785] [2022-11-18 19:54:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-18 19:54:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:49,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100293785] [2022-11-18 19:54:49,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100293785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:49,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:49,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031414973] [2022-11-18 19:54:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:49,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:49,638 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-18 19:54:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:51,042 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-18 19:54:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 637 [2022-11-18 19:54:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:51,061 INFO L225 Difference]: With dead ends: 28295 [2022-11-18 19:54:51,061 INFO L226 Difference]: Without dead ends: 15940 [2022-11-18 19:54:51,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:51,070 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 278 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:51,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-18 19:54:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-18 19:54:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-18 19:54:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15042 states have (on average 1.032974338518814) internal successors, (15538), 15042 states have internal predecessors, (15538), 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-18 19:54:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-18 19:54:51,271 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 637 [2022-11-18 19:54:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:51,272 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-18 19:54:51,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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-18 19:54:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-18 19:54:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-11-18 19:54:51,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:51,282 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:51,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:54:51,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1686621216, now seen corresponding path program 1 times [2022-11-18 19:54:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:51,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920778589] [2022-11-18 19:54:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 19:54:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:52,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920778589] [2022-11-18 19:54:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920778589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:52,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021206651] [2022-11-18 19:54:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:52,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:52,075 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-18 19:54:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:53,390 INFO L93 Difference]: Finished difference Result 33081 states and 34229 transitions. [2022-11-18 19:54:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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 661 [2022-11-18 19:54:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:53,404 INFO L225 Difference]: With dead ends: 33081 [2022-11-18 19:54:53,405 INFO L226 Difference]: Without dead ends: 18339 [2022-11-18 19:54:53,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:53,413 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 87 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:53,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 512 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 19:54:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18339 states. [2022-11-18 19:54:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18339 to 18038. [2022-11-18 19:54:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18038 states, 18037 states have (on average 1.0326550978544105) internal successors, (18626), 18037 states have internal predecessors, (18626), 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-18 19:54:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 18626 transitions. [2022-11-18 19:54:53,658 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 18626 transitions. Word has length 661 [2022-11-18 19:54:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:53,658 INFO L495 AbstractCegarLoop]: Abstraction has 18038 states and 18626 transitions. [2022-11-18 19:54:53,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-18 19:54:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 18626 transitions. [2022-11-18 19:54:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2022-11-18 19:54:53,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:53,676 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:53,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:54:53,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1912380469, now seen corresponding path program 1 times [2022-11-18 19:54:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:53,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17108990] [2022-11-18 19:54:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-18 19:54:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17108990] [2022-11-18 19:54:54,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17108990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:54,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:54,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309162992] [2022-11-18 19:54:54,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:54,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:54,309 INFO L87 Difference]: Start difference. First operand 18038 states and 18626 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-18 19:54:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:55,654 INFO L93 Difference]: Finished difference Result 38762 states and 40068 transitions. [2022-11-18 19:54:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:55,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 763 [2022-11-18 19:54:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:55,676 INFO L225 Difference]: With dead ends: 38762 [2022-11-18 19:54:55,676 INFO L226 Difference]: Without dead ends: 20726 [2022-11-18 19:54:55,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:55,688 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:55,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 171 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 19:54:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20726 states. [2022-11-18 19:54:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 19829. [2022-11-18 19:54:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19828 states have (on average 1.030260238047206) internal successors, (20428), 19828 states have internal predecessors, (20428), 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-18 19:54:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20428 transitions. [2022-11-18 19:54:56,035 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20428 transitions. Word has length 763 [2022-11-18 19:54:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:56,036 INFO L495 AbstractCegarLoop]: Abstraction has 19829 states and 20428 transitions. [2022-11-18 19:54:56,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-18 19:54:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20428 transitions. [2022-11-18 19:54:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2022-11-18 19:54:56,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:56,061 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:56,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:54:56,062 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash 160756345, now seen corresponding path program 1 times [2022-11-18 19:54:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042320432] [2022-11-18 19:54:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-11-18 19:54:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042320432] [2022-11-18 19:54:56,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042320432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:56,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:56,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:54:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797401332] [2022-11-18 19:54:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:56,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:56,746 INFO L87 Difference]: Start difference. First operand 19829 states and 20428 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-18 19:54:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:58,203 INFO L93 Difference]: Finished difference Result 42641 states and 44001 transitions. [2022-11-18 19:54:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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 821 [2022-11-18 19:54:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:58,232 INFO L225 Difference]: With dead ends: 42641 [2022-11-18 19:54:58,233 INFO L226 Difference]: Without dead ends: 23113 [2022-11-18 19:54:58,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:58,242 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 505 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 19:54:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23113 states. [2022-11-18 19:54:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23113 to 19820. [2022-11-18 19:54:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.0282052575811091) internal successors, (20378), 19819 states have internal predecessors, (20378), 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-18 19:54:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 20378 transitions. [2022-11-18 19:54:58,574 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 20378 transitions. Word has length 821 [2022-11-18 19:54:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:58,575 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 20378 transitions. [2022-11-18 19:54:58,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-18 19:54:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 20378 transitions. [2022-11-18 19:54:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-18 19:54:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:58,592 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:58,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:54:58,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:54:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1504524939, now seen corresponding path program 1 times [2022-11-18 19:54:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081296595] [2022-11-18 19:54:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 587 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-18 19:55:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:00,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081296595] [2022-11-18 19:55:00,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081296595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:00,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547536098] [2022-11-18 19:55:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:00,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:00,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:00,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:55:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:00,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:55:00,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-18 19:55:00,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:55:00,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547536098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:00,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:55:00,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 19:55:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154857865] [2022-11-18 19:55:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:00,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:55:00,858 INFO L87 Difference]: Start difference. First operand 19820 states and 20378 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-18 19:55:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:02,383 INFO L93 Difference]: Finished difference Result 43838 states and 45054 transitions. [2022-11-18 19:55:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 842 [2022-11-18 19:55:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:02,402 INFO L225 Difference]: With dead ends: 43838 [2022-11-18 19:55:02,403 INFO L226 Difference]: Without dead ends: 24319 [2022-11-18 19:55:02,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:55:02,413 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:02,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 496 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:55:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2022-11-18 19:55:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 21917. [2022-11-18 19:55:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21917 states, 21916 states have (on average 1.0275141449169556) internal successors, (22519), 21916 states have internal predecessors, (22519), 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-18 19:55:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21917 states to 21917 states and 22519 transitions. [2022-11-18 19:55:02,644 INFO L78 Accepts]: Start accepts. Automaton has 21917 states and 22519 transitions. Word has length 842 [2022-11-18 19:55:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:02,645 INFO L495 AbstractCegarLoop]: Abstraction has 21917 states and 22519 transitions. [2022-11-18 19:55:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-18 19:55:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21917 states and 22519 transitions. [2022-11-18 19:55:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2022-11-18 19:55:02,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:02,664 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:02,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:02,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 19:55:02,866 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:02,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1397744587, now seen corresponding path program 1 times [2022-11-18 19:55:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:02,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079685754] [2022-11-18 19:55:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2022-11-18 19:55:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079685754] [2022-11-18 19:55:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079685754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:03,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:03,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:55:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639068669] [2022-11-18 19:55:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:03,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:03,893 INFO L87 Difference]: Start difference. First operand 21917 states and 22519 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-18 19:55:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:05,523 INFO L93 Difference]: Finished difference Result 47734 states and 49018 transitions. [2022-11-18 19:55:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 875 [2022-11-18 19:55:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:05,547 INFO L225 Difference]: With dead ends: 47734 [2022-11-18 19:55:05,547 INFO L226 Difference]: Without dead ends: 25819 [2022-11-18 19:55:05,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:05,556 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:05,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 19:55:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25819 states. [2022-11-18 19:55:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25819 to 21615. [2022-11-18 19:55:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21615 states, 21614 states have (on average 1.0270657906912186) internal successors, (22199), 21614 states have internal predecessors, (22199), 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-18 19:55:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 22199 transitions. [2022-11-18 19:55:05,872 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 22199 transitions. Word has length 875 [2022-11-18 19:55:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:05,872 INFO L495 AbstractCegarLoop]: Abstraction has 21615 states and 22199 transitions. [2022-11-18 19:55:05,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-18 19:55:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 22199 transitions. [2022-11-18 19:55:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2022-11-18 19:55:05,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:05,891 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:05,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 19:55:05,891 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:55:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -547488288, now seen corresponding path program 1 times [2022-11-18 19:55:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:05,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431027740] [2022-11-18 19:55:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 661 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-18 19:55:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:07,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431027740] [2022-11-18 19:55:07,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431027740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:07,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922858010] [2022-11-18 19:55:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:07,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:07,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:07,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fae91806-7304-4853-8915-d569e5bf06d7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:55:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:07,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 19:55:07,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:08,795 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse4 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse4 10) 1))) (let ((.cse5 (div .cse7 5))) (and (not (= (mod .cse4 10) 0)) (= (mod (+ .cse5 1) 29) 0) (<= (mod .cse5 29) .cse6) (= (mod .cse7 5) 0) (< (+ (div .cse4 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 10))) (let ((.cse9 (div (+ .cse8 1) 5))) (and (= (mod .cse8 5) 0) (= (mod .cse9 29) 0) (<= (mod (div .cse10 50) 29) .cse2) (= (mod .cse10 10) 0) (<= 0 (+ .cse9 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (div (+ .cse11 1) 5))) (and (= (mod .cse11 5) 0) (= (mod .cse12 29) 0) (<= (mod (div .cse13 50) 29) .cse2) (<= 0 (+ .cse12 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse14 (+ (div .cse15 10) 1))) (and (<= (mod (div .cse14 5) 29) .cse2) (< .cse15 0) (= (mod .cse14 5) 0) (not (< (+ (div .cse15 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse18 (div .cse16 50))) (let ((.cse17 (mod .cse18 29))) (and (= (mod (div (+ (div .cse16 10) 1) 5) 29) 0) (<= .cse17 .cse2) (= 0 .cse17) (= (mod .cse16 10) 0) (not (< (+ .cse18 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse22 50))) (let ((.cse19 (div (+ (div .cse22 10) 1) 5)) (.cse21 (+ .cse20 1))) (and (not (= (mod .cse19 29) 0)) (= 0 (mod .cse20 29)) (<= (mod .cse21 29) .cse6) (= (mod .cse22 10) 0) (not (= (mod (+ .cse19 1) 29) 0)) (< .cse21 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (div (* 9 v_~a29~0_899) 50))) (let ((.cse23 (mod .cse24 29))) (and (<= .cse23 .cse2) (= 0 .cse23) (not (< (+ .cse24 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse27 50)) (.cse26 (div (+ (div .cse27 10) 1) 5))) (and (= (mod (+ .cse25 1) 29) 0) (<= (mod .cse25 29) .cse2) (= (mod (+ .cse26 1) 29) 0) (= (mod .cse27 10) 0) (not (< .cse26 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse29 10))) (let ((.cse30 (div (+ .cse28 1) 5))) (and (= (mod .cse28 5) 0) (<= (mod (div .cse29 50) 29) .cse2) (= (mod (+ .cse30 1) 29) 0) (not (< .cse30 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse33 50)) (.cse32 (div (+ (div .cse33 10) 1) 5))) (and (= (mod (+ .cse31 1) 29) 0) (<= (mod .cse31 29) .cse2) (= (mod (+ .cse32 1) 29) 0) (not (< .cse32 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse34 (div (+ (div .cse35 10) 1) 5))) (and (= (mod .cse34 29) 0) (<= (mod (div .cse35 50) 29) .cse2) (= (mod .cse35 10) 0) (<= 0 (+ .cse34 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (* 9 v_~a29~0_899))) (let ((.cse36 (div .cse37 50))) (and (= (mod (+ .cse36 1) 29) 0) (<= (mod .cse36 29) .cse2) (not (< (div .cse37 10) 0)) (= (mod .cse37 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse39 (div .cse40 50)) (.cse38 (div .cse40 10))) (and (= (mod (div (+ .cse38 1) 5) 29) 0) (= (mod (+ .cse39 1) 29) 0) (<= (mod .cse39 29) .cse2) (not (< .cse38 0)) (= (mod .cse40 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse41 (* 9 v_~a29~0_899))) (let ((.cse43 (div .cse41 50))) (let ((.cse42 (mod .cse43 29))) (and (= (mod (div (+ (div .cse41 10) 1) 5) 29) 0) (<= .cse42 .cse2) (= 0 .cse42) (not (< (+ .cse43 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse46 (div .cse44 5))) (let ((.cse45 (+ .cse46 1))) (and (not (= (mod .cse44 5) 0)) (not (< .cse45 0)) (< .cse46 0) (<= (mod .cse45 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse47 (div .cse49 10))) (let ((.cse48 (div (+ .cse47 1) 5))) (and (= (mod .cse47 5) 0) (= (mod (+ .cse48 1) 29) 0) (<= (mod (div .cse49 50) 29) .cse6) (= (mod .cse49 10) 0) (< .cse48 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (* 9 v_~a29~0_899))) (let ((.cse50 (div (+ (div .cse51 10) 1) 5)) (.cse52 (div .cse51 50))) (and (= (mod .cse50 29) 0) (not (= (mod .cse51 10) 0)) (<= (mod (+ .cse50 1) 29) .cse6) (= 0 (mod .cse52 29)) (< (+ .cse52 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse53 (div .cse55 50))) (let ((.cse56 (+ .cse53 1))) (let ((.cse54 (mod .cse56 29))) (and (not (= 0 (mod .cse53 29))) (not (= .cse54 0)) (= (mod (+ (div (+ (div .cse55 10) 1) 5) 1) 29) 0) (<= .cse54 .cse6) (= (mod .cse55 10) 0) (< .cse56 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse57 50))) (and (= (mod (div .cse57 10) 5) 0) (<= (mod .cse58 29) .cse2) (<= 0 .cse58) (= (mod .cse57 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (= (mod (+ .cse60 1) 29) 0) (<= (mod .cse60 29) .cse2) (not (< .cse60 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (+ (div .cse61 10) 1)) (.cse63 (div .cse61 50))) (and (not (= (mod .cse61 10) 0)) (<= (mod (div .cse62 5) 29) .cse6) (= 0 (mod .cse63 29)) (= (mod .cse62 5) 0) (< (+ .cse63 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse65 (* 9 v_~a29~0_899))) (let ((.cse64 (div .cse65 50))) (and (<= (mod .cse64 29) .cse2) (= (mod (+ (div (+ (div .cse65 10) 1) 5) 1) 29) 0) (<= 0 .cse64))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66) (= (mod .cse67 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse70 (div (+ (div .cse68 10) 1) 5))) (let ((.cse69 (mod (+ .cse70 1) 29))) (and (= (mod (+ (div .cse68 50) 1) 29) 0) (not (= (mod .cse68 10) 0)) (= .cse69 0) (< .cse70 0) (<= .cse69 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse71 (div .cse72 50))) (and (= (mod (+ .cse71 1) 29) 0) (<= (mod .cse71 29) .cse2) (not (< (div .cse72 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse75 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse75 10)) (.cse74 (div .cse75 50))) (and (= (mod .cse73 5) 0) (<= (mod .cse74 29) .cse2) (= (mod (+ (div (+ .cse73 1) 5) 1) 29) 0) (<= 0 .cse74))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse80 (+ (div .cse77 10) 1))) (let ((.cse79 (div .cse80 5))) (let ((.cse78 (mod .cse79 29)) (.cse76 (div .cse77 50))) (and (not (= 0 (mod .cse76 29))) (not (= (mod .cse77 10) 0)) (not (= .cse78 0)) (<= .cse78 .cse6) (not (= (mod (+ .cse79 1) 29) 0)) (= (mod .cse80 5) 0) (< (+ .cse76 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse81 50))) (and (= (mod (div (+ (div .cse81 10) 1) 5) 29) 0) (<= (mod .cse82 29) .cse2) (<= 0 .cse82))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse88 (mod (div (+ (div .cse89 10) 1) 5) 29))) (and (= .cse88 0) (<= .cse88 .cse2) (< .cse89 0) (not (< (+ (div .cse89 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse90 (+ (div .cse93 10) 1))) (let ((.cse91 (div .cse90 5)) (.cse92 (div .cse93 50))) (and (not (= (mod .cse90 5) 0)) (not (= (mod .cse91 29) 0)) (<= (mod (+ .cse91 1) 29) .cse6) (= 0 (mod .cse92 29)) (< (+ .cse92 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse94 (div (+ (div .cse95 10) 1) 5))) (and (= (mod (+ .cse94 1) 29) 0) (= 0 (mod (div .cse95 50) 29)) (<= (mod .cse94 29) .cse2) (< .cse95 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse96 29) .cse2) (<= 0 .cse96)))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse97 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse97 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse101 10))) (let ((.cse100 (div (+ .cse99 1) 5)) (.cse98 (mod (+ (div .cse101 50) 1) 29))) (and (= .cse98 0) (not (= (mod .cse99 5) 0)) (= (mod (+ .cse100 1) 29) 0) (= (mod .cse101 10) 0) (< .cse100 0) (<= .cse98 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse102 50))) (let ((.cse103 (mod .cse104 29))) (and (= (mod (div .cse102 10) 5) 0) (<= .cse103 .cse2) (= 0 .cse103) (= (mod .cse102 10) 0) (< (+ .cse104 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse109 50))) (let ((.cse107 (div .cse109 10)) (.cse110 (+ .cse105 1))) (let ((.cse106 (mod .cse110 29)) (.cse108 (div (+ .cse107 1) 5))) (and (not (= 0 (mod .cse105 29))) (not (= .cse106 0)) (not (= (mod .cse107 5) 0)) (not (= (mod .cse108 29) 0)) (<= .cse106 .cse6) (= (mod .cse109 10) 0) (not (= (mod (+ .cse108 1) 29) 0)) (< .cse110 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse114 50))) (let ((.cse111 (div .cse114 10)) (.cse113 (+ .cse112 1))) (and (= (mod (div (+ .cse111 1) 5) 29) 0) (not (= (mod .cse111 5) 0)) (= 0 (mod .cse112 29)) (<= (mod .cse113 29) .cse6) (= (mod .cse114 10) 0) (< .cse113 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse116 50))) (let ((.cse115 (mod .cse117 29))) (and (<= .cse115 .cse2) (= 0 .cse115) (= (mod .cse116 10) 0) (not (< (+ .cse117 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (and (= (mod (+ .cse118 1) 29) 0) (= 0 (mod (div .cse119 50) 29)) (= (mod .cse119 10) 0) (< .cse118 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse120 50))) (and (= (mod (div .cse120 10) 5) 0) (= (mod (+ .cse121 1) 29) 0) (<= (mod .cse121 29) .cse2) (not (< .cse121 0)) (= (mod .cse120 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (let ((.cse122 (mod .cse123 29))) (and (= .cse122 0) (not (< (+ .cse123 1) 0)) (<= .cse122 .cse2) (< .cse124 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (< .cse125 0) (<= (mod (+ .cse125 1) 29) .cse2) (not (< (+ (div .cse126 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div (+ (div .cse128 10) 1) 5))) (and (not (< (+ .cse127 1) 0)) (<= (mod .cse127 29) .cse6) (< (+ (div .cse128 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse132 50))) (let ((.cse131 (div (+ (div .cse132 10) 1) 5)) (.cse130 (+ .cse129 1))) (and (not (= 0 (mod .cse129 29))) (not (= (mod .cse130 29) 0)) (= (mod .cse131 29) 0) (not (= (mod .cse132 10) 0)) (<= (mod (+ .cse131 1) 29) .cse6) (< .cse130 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse136 10))) (let ((.cse134 (div (+ .cse133 1) 5)) (.cse135 (div .cse136 50))) (and (= (mod .cse133 5) 0) (not (= (mod .cse134 29) 0)) (<= (mod .cse135 29) .cse6) (= (mod .cse136 10) 0) (not (= (mod (+ .cse134 1) 29) 0)) (< (+ .cse135 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse138 (+ (div .cse137 10) 1))) (let ((.cse139 (div .cse138 5))) (let ((.cse140 (mod (+ .cse139 1) 29))) (and (= (mod (+ (div .cse137 50) 1) 29) 0) (not (= (mod .cse138 5) 0)) (not (= (mod .cse139 29) 0)) (<= .cse140 .cse6) (not (= .cse140 0)))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse143 50)) (.cse141 (div .cse143 10))) (and (= (mod (div (+ .cse141 1) 5) 29) 0) (= (mod (+ .cse142 1) 29) 0) (<= (mod .cse142 29) .cse2) (not (< .cse141 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse145 10))) (let ((.cse146 (div (+ .cse144 1) 5))) (and (= (mod .cse144 5) 0) (<= (mod (div .cse145 50) 29) .cse2) (= (mod (+ .cse146 1) 29) 0) (= (mod .cse145 10) 0) (not (< .cse146 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse149 10)) (.cse148 (div .cse149 50))) (and (= (mod .cse147 5) 0) (<= (mod .cse148 29) .cse2) (= (mod (+ (div (+ .cse147 1) 5) 1) 29) 0) (<= 0 .cse148) (= (mod .cse149 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse150 (+ (div .cse151 10) 1))) (and (not (< .cse150 0)) (<= (mod (div .cse150 5) 29) .cse2) (< .cse151 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse155 (div .cse154 10))) (let ((.cse153 (div (+ .cse155 1) 5)) (.cse152 (mod (+ (div .cse154 50) 1) 29))) (and (= .cse152 0) (not (= (mod .cse153 29) 0)) (= (mod .cse154 10) 0) (not (= (mod (+ .cse153 1) 29) 0)) (< .cse155 0) (<= .cse152 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse158 (div .cse157 10)) (.cse156 (mod (+ (div .cse157 50) 1) 29))) (and (= .cse156 0) (= (mod .cse157 10) 0) (not (= (mod (+ (div (+ .cse158 1) 5) 1) 29) 0)) (< .cse158 0) (<= .cse156 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse159 (* 9 v_~a29~0_899))) (let ((.cse161 (div .cse159 50))) (let ((.cse160 (mod .cse161 29))) (and (= (mod (div .cse159 10) 5) 0) (<= .cse160 .cse2) (= 0 .cse160) (= (mod .cse159 10) 0) (not (< (+ .cse161 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse163 (* 9 v_~a29~0_899))) (let ((.cse162 (div .cse163 50))) (and (<= (mod .cse162 29) .cse2) (<= 0 .cse162) (= (mod .cse163 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse166 (* 9 v_~a29~0_899))) (let ((.cse167 (+ (div .cse166 10) 1))) (let ((.cse164 (div .cse166 50)) (.cse168 (div .cse167 5))) (let ((.cse169 (mod (+ .cse168 1) 29)) (.cse165 (+ .cse164 1))) (and (not (= 0 (mod .cse164 29))) (not (= (mod .cse165 29) 0)) (not (= (mod .cse166 10) 0)) (not (= (mod .cse167 5) 0)) (not (= (mod .cse168 29) 0)) (<= .cse169 .cse6) (not (= .cse169 0)) (< .cse165 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse171 (* 9 v_~a29~0_899))) (let ((.cse172 (div (+ (div .cse171 10) 1) 5))) (let ((.cse170 (mod .cse172 29))) (and (= .cse170 0) (= (mod (+ (div .cse171 50) 1) 29) 0) (not (= (mod .cse171 10) 0)) (< (+ .cse172 1) 0) (<= .cse170 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse173 (* 9 v_~a29~0_899))) (let ((.cse174 (div .cse173 50))) (and (= (mod (div .cse173 10) 5) 0) (<= (mod .cse174 29) .cse2) (<= 0 .cse174))))))) is different from true [2022-11-18 20:04:50,142 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse8 (* 9 v_~a29~0_899))) (let ((.cse10 (+ (div .cse8 10) 1))) (let ((.cse9 (div .cse10 5))) (and (not (= (mod .cse8 10) 0)) (= (mod (+ .cse9 1) 29) 0) (<= (mod .cse9 29) .cse6) (= (mod .cse10 5) 0) (< (+ (div .cse8 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (div (+ .cse11 1) 5))) (and (= (mod .cse11 5) 0) (= (mod .cse12 29) 0) (<= (mod (div .cse13 50) 29) .cse2) (= (mod .cse13 10) 0) (<= 0 (+ .cse12 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (div (+ .cse14 1) 5))) (and (= (mod .cse14 5) 0) (= (mod .cse15 29) 0) (<= (mod (div .cse16 50) 29) .cse2) (<= 0 (+ .cse15 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse17 (+ (div .cse18 10) 1))) (and (<= (mod (div .cse17 5) 29) .cse2) (< .cse18 0) (= (mod .cse17 5) 0) (not (< (+ (div .cse18 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse19 50))) (let ((.cse20 (mod .cse21 29))) (and (= (mod (div (+ (div .cse19 10) 1) 5) 29) 0) (<= .cse20 .cse2) (= 0 .cse20) (= (mod .cse19 10) 0) (not (< (+ .cse21 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse25 50))) (let ((.cse22 (div (+ (div .cse25 10) 1) 5)) (.cse24 (+ .cse23 1))) (and (not (= (mod .cse22 29) 0)) (= 0 (mod .cse23 29)) (<= (mod .cse24 29) .cse6) (= (mod .cse25 10) 0) (not (= (mod (+ .cse22 1) 29) 0)) (< .cse24 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (div (* 9 v_~a29~0_899) 50))) (let ((.cse26 (mod .cse27 29))) (and (<= .cse26 .cse2) (= 0 .cse26) (not (< (+ .cse27 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse30 50)) (.cse29 (div (+ (div .cse30 10) 1) 5))) (and (= (mod (+ .cse28 1) 29) 0) (<= (mod .cse28 29) .cse2) (= (mod (+ .cse29 1) 29) 0) (= (mod .cse30 10) 0) (not (< .cse29 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse32 10))) (let ((.cse33 (div (+ .cse31 1) 5))) (and (= (mod .cse31 5) 0) (<= (mod (div .cse32 50) 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (not (< .cse33 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse36 50)) (.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (= (mod (+ .cse35 1) 29) 0) (not (< .cse35 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div (+ (div .cse38 10) 1) 5))) (and (= (mod .cse37 29) 0) (<= (mod (div .cse38 50) 29) .cse2) (= (mod .cse38 10) 0) (<= 0 (+ .cse37 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse39 (div .cse40 50))) (and (= (mod (+ .cse39 1) 29) 0) (<= (mod .cse39 29) .cse2) (not (< (div .cse40 10) 0)) (= (mod .cse40 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse43 50)) (.cse41 (div .cse43 10))) (and (= (mod (div (+ .cse41 1) 5) 29) 0) (= (mod (+ .cse42 1) 29) 0) (<= (mod .cse42 29) .cse2) (not (< .cse41 0)) (= (mod .cse43 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse44 50))) (let ((.cse45 (mod .cse46 29))) (and (= (mod (div (+ (div .cse44 10) 1) 5) 29) 0) (<= .cse45 .cse2) (= 0 .cse45) (not (< (+ .cse46 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse49 (div .cse47 5))) (let ((.cse48 (+ .cse49 1))) (and (not (= (mod .cse47 5) 0)) (not (< .cse48 0)) (< .cse49 0) (<= (mod .cse48 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse50 (div .cse52 10))) (let ((.cse51 (div (+ .cse50 1) 5))) (and (= (mod .cse50 5) 0) (= (mod (+ .cse51 1) 29) 0) (<= (mod (div .cse52 50) 29) .cse6) (= (mod .cse52 10) 0) (< .cse51 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse53 (div (+ (div .cse54 10) 1) 5)) (.cse55 (div .cse54 50))) (and (= (mod .cse53 29) 0) (not (= (mod .cse54 10) 0)) (<= (mod (+ .cse53 1) 29) .cse6) (= 0 (mod .cse55 29)) (< (+ .cse55 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse57 (div .cse56 50))) (and (= (mod (div .cse56 10) 5) 0) (<= (mod .cse57 29) .cse2) (<= 0 .cse57) (= (mod .cse56 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse59 (div .cse58 50))) (and (= (mod (div .cse58 10) 5) 0) (= (mod (+ .cse59 1) 29) 0) (<= (mod .cse59 29) .cse2) (not (< .cse59 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (+ (div .cse60 10) 1)) (.cse62 (div .cse60 50))) (and (not (= (mod .cse60 10) 0)) (<= (mod (div .cse61 5) 29) .cse6) (= 0 (mod .cse62 29)) (= (mod .cse61 5) 0) (< (+ .cse62 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse63 (div .cse64 50))) (and (<= (mod .cse63 29) .cse2) (= (mod (+ (div (+ (div .cse64 10) 1) 5) 1) 29) 0) (<= 0 .cse63))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse65 (div .cse66 50))) (and (<= (mod .cse65 29) .cse2) (= (mod (+ (div (+ (div .cse66 10) 1) 5) 1) 29) 0) (<= 0 .cse65) (= (mod .cse66 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse69 (div (+ (div .cse67 10) 1) 5))) (let ((.cse68 (mod (+ .cse69 1) 29))) (and (= (mod (+ (div .cse67 50) 1) 29) 0) (not (= (mod .cse67 10) 0)) (= .cse68 0) (< .cse69 0) (<= .cse68 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse71 (* 9 v_~a29~0_899))) (let ((.cse70 (div .cse71 50))) (and (= (mod (+ .cse70 1) 29) 0) (<= (mod .cse70 29) .cse2) (not (< (div .cse71 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse72 (div .cse74 10)) (.cse73 (div .cse74 50))) (and (= (mod .cse72 5) 0) (<= (mod .cse73 29) .cse2) (= (mod (+ (div (+ .cse72 1) 5) 1) 29) 0) (<= 0 .cse73))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse79 (+ (div .cse76 10) 1))) (let ((.cse78 (div .cse79 5))) (let ((.cse77 (mod .cse78 29)) (.cse75 (div .cse76 50))) (and (not (= 0 (mod .cse75 29))) (not (= (mod .cse76 10) 0)) (not (= .cse77 0)) (<= .cse77 .cse6) (not (= (mod (+ .cse78 1) 29) 0)) (= (mod .cse79 5) 0) (< (+ .cse75 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse81 (div .cse80 50))) (and (= (mod (div (+ (div .cse80 10) 1) 5) 29) 0) (<= (mod .cse81 29) .cse2) (<= 0 .cse81))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse82 50))) (let ((.cse83 (mod .cse84 29))) (and (= (mod (div .cse82 10) 5) 0) (<= .cse83 .cse2) (= 0 .cse83) (not (< (+ .cse84 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse85 (div (+ (div .cse86 10) 1) 5))) (and (<= 0 .cse85) (<= (mod .cse85 29) .cse2) (< .cse86 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse87 (mod (div (+ (div .cse88 10) 1) 5) 29))) (and (= .cse87 0) (<= .cse87 .cse2) (< .cse88 0) (not (< (+ (div .cse88 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse89 29) .cse2) (<= 0 .cse89)))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse90 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse90 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse94 10))) (let ((.cse93 (div (+ .cse92 1) 5)) (.cse91 (mod (+ (div .cse94 50) 1) 29))) (and (= .cse91 0) (not (= (mod .cse92 5) 0)) (= (mod (+ .cse93 1) 29) 0) (= (mod .cse94 10) 0) (< .cse93 0) (<= .cse91 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse97 (div .cse95 50))) (let ((.cse96 (mod .cse97 29))) (and (= (mod (div .cse95 10) 5) 0) (<= .cse96 .cse2) (= 0 .cse96) (= (mod .cse95 10) 0) (< (+ .cse97 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse102 50))) (let ((.cse100 (div .cse102 10)) (.cse103 (+ .cse98 1))) (let ((.cse99 (mod .cse103 29)) (.cse101 (div (+ .cse100 1) 5))) (and (not (= 0 (mod .cse98 29))) (not (= .cse99 0)) (not (= (mod .cse100 5) 0)) (not (= (mod .cse101 29) 0)) (<= .cse99 .cse6) (= (mod .cse102 10) 0) (not (= (mod (+ .cse101 1) 29) 0)) (< .cse103 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse107 50))) (let ((.cse104 (div .cse107 10)) (.cse106 (+ .cse105 1))) (and (= (mod (div (+ .cse104 1) 5) 29) 0) (not (= (mod .cse104 5) 0)) (= 0 (mod .cse105 29)) (<= (mod .cse106 29) .cse6) (= (mod .cse107 10) 0) (< .cse106 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse109 50))) (let ((.cse108 (mod .cse110 29))) (and (<= .cse108 .cse2) (= 0 .cse108) (= (mod .cse109 10) 0) (not (< (+ .cse110 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse111 50))) (and (= (mod (div .cse111 10) 5) 0) (= (mod (+ .cse112 1) 29) 0) (<= (mod .cse112 29) .cse2) (not (< .cse112 0)) (= (mod .cse111 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse114 (div (+ (div .cse115 10) 1) 5))) (let ((.cse113 (mod .cse114 29))) (and (= .cse113 0) (not (< (+ .cse114 1) 0)) (<= .cse113 .cse2) (< .cse115 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse116 (div (+ (div .cse117 10) 1) 5))) (and (< .cse116 0) (<= (mod (+ .cse116 1) 29) .cse2) (not (< (+ (div .cse117 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (and (not (< (+ .cse118 1) 0)) (<= (mod .cse118 29) .cse6) (< (+ (div .cse119 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse120 (div .cse123 50))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5)) (.cse121 (+ .cse120 1))) (and (not (= 0 (mod .cse120 29))) (not (= (mod .cse121 29) 0)) (= (mod .cse122 29) 0) (not (= (mod .cse123 10) 0)) (<= (mod (+ .cse122 1) 29) .cse6) (< .cse121 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse124 (div .cse127 10))) (let ((.cse125 (div (+ .cse124 1) 5)) (.cse126 (div .cse127 50))) (and (= (mod .cse124 5) 0) (not (= (mod .cse125 29) 0)) (<= (mod .cse126 29) .cse6) (= (mod .cse127 10) 0) (not (= (mod (+ .cse125 1) 29) 0)) (< (+ .cse126 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse130 50)) (.cse128 (div .cse130 10))) (and (= (mod (div (+ .cse128 1) 5) 29) 0) (= (mod (+ .cse129 1) 29) 0) (<= (mod .cse129 29) .cse2) (not (< .cse128 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse132 (div (+ (div .cse133 10) 1) 5)) (.cse131 (mod (+ (div .cse133 50) 1) 29))) (and (= .cse131 0) (not (= (mod .cse132 29) 0)) (= (mod .cse133 10) 0) (not (= (mod (+ .cse132 1) 29) 0)) (<= .cse131 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse134 (div .cse135 10))) (let ((.cse136 (div (+ .cse134 1) 5))) (and (= (mod .cse134 5) 0) (<= (mod (div .cse135 50) 29) .cse2) (= (mod (+ .cse136 1) 29) 0) (= (mod .cse135 10) 0) (not (< .cse136 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse139 10)) (.cse138 (div .cse139 50))) (and (= (mod .cse137 5) 0) (<= (mod .cse138 29) .cse2) (= (mod (+ (div (+ .cse137 1) 5) 1) 29) 0) (<= 0 .cse138) (= (mod .cse139 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (+ (div .cse141 10) 1))) (and (not (< .cse140 0)) (<= (mod (div .cse140 5) 29) .cse2) (< .cse141 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse143 10)) (.cse142 (mod (+ (div .cse143 50) 1) 29))) (and (= .cse142 0) (= (mod .cse143 10) 0) (not (= (mod (+ (div (+ .cse144 1) 5) 1) 29) 0)) (< .cse144 0) (<= .cse142 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse145 50))) (let ((.cse146 (mod .cse147 29))) (and (= (mod (div .cse145 10) 5) 0) (<= .cse146 .cse2) (= 0 .cse146) (= (mod .cse145 10) 0) (not (< (+ .cse147 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse149 50))) (and (<= (mod .cse148 29) .cse2) (<= 0 .cse148) (= (mod .cse149 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse153 (+ (div .cse152 10) 1))) (let ((.cse150 (div .cse152 50)) (.cse154 (div .cse153 5))) (let ((.cse155 (mod (+ .cse154 1) 29)) (.cse151 (+ .cse150 1))) (and (not (= 0 (mod .cse150 29))) (not (= (mod .cse151 29) 0)) (not (= (mod .cse152 10) 0)) (not (= (mod .cse153 5) 0)) (not (= (mod .cse154 29) 0)) (<= .cse155 .cse6) (not (= .cse155 0)) (< .cse151 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse158 (div (+ (div .cse157 10) 1) 5))) (let ((.cse156 (mod .cse158 29))) (and (= .cse156 0) (= (mod (+ (div .cse157 50) 1) 29) 0) (not (= (mod .cse157 10) 0)) (< (+ .cse158 1) 0) (<= .cse156 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse159 (* 9 v_~a29~0_899))) (let ((.cse160 (div .cse159 50))) (and (= (mod (div .cse159 10) 5) 0) (<= (mod .cse160 29) .cse2) (<= 0 .cse160))))))) is different from true [2022-11-18 20:06:10,621 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse8 (* 9 v_~a29~0_899))) (let ((.cse10 (+ (div .cse8 10) 1))) (let ((.cse9 (div .cse10 5))) (and (not (= (mod .cse8 10) 0)) (= (mod (+ .cse9 1) 29) 0) (<= (mod .cse9 29) .cse6) (= (mod .cse10 5) 0) (< (+ (div .cse8 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (div (+ .cse11 1) 5))) (and (= (mod .cse11 5) 0) (= (mod .cse12 29) 0) (<= (mod (div .cse13 50) 29) .cse2) (= (mod .cse13 10) 0) (<= 0 (+ .cse12 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (div (+ .cse14 1) 5))) (and (= (mod .cse14 5) 0) (= (mod .cse15 29) 0) (<= (mod (div .cse16 50) 29) .cse2) (<= 0 (+ .cse15 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse17 (+ (div .cse18 10) 1))) (and (<= (mod (div .cse17 5) 29) .cse2) (< .cse18 0) (= (mod .cse17 5) 0) (not (< (+ (div .cse18 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse19 50))) (let ((.cse20 (mod .cse21 29))) (and (= (mod (div (+ (div .cse19 10) 1) 5) 29) 0) (<= .cse20 .cse2) (= 0 .cse20) (= (mod .cse19 10) 0) (not (< (+ .cse21 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse25 50))) (let ((.cse22 (div (+ (div .cse25 10) 1) 5)) (.cse24 (+ .cse23 1))) (and (not (= (mod .cse22 29) 0)) (= 0 (mod .cse23 29)) (<= (mod .cse24 29) .cse6) (= (mod .cse25 10) 0) (not (= (mod (+ .cse22 1) 29) 0)) (< .cse24 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (div (* 9 v_~a29~0_899) 50))) (let ((.cse26 (mod .cse27 29))) (and (<= .cse26 .cse2) (= 0 .cse26) (not (< (+ .cse27 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse30 50)) (.cse29 (div (+ (div .cse30 10) 1) 5))) (and (= (mod (+ .cse28 1) 29) 0) (<= (mod .cse28 29) .cse2) (= (mod (+ .cse29 1) 29) 0) (= (mod .cse30 10) 0) (not (< .cse29 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse32 10))) (let ((.cse33 (div (+ .cse31 1) 5))) (and (= (mod .cse31 5) 0) (<= (mod (div .cse32 50) 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (not (< .cse33 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse36 50)) (.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (= (mod (+ .cse35 1) 29) 0) (not (< .cse35 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div (+ (div .cse38 10) 1) 5))) (and (= (mod .cse37 29) 0) (<= (mod (div .cse38 50) 29) .cse2) (= (mod .cse38 10) 0) (<= 0 (+ .cse37 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse39 (div .cse40 50))) (and (= (mod (+ .cse39 1) 29) 0) (<= (mod .cse39 29) .cse2) (not (< (div .cse40 10) 0)) (= (mod .cse40 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse43 50)) (.cse41 (div .cse43 10))) (and (= (mod (div (+ .cse41 1) 5) 29) 0) (= (mod (+ .cse42 1) 29) 0) (<= (mod .cse42 29) .cse2) (not (< .cse41 0)) (= (mod .cse43 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse44 50))) (let ((.cse45 (mod .cse46 29))) (and (= (mod (div (+ (div .cse44 10) 1) 5) 29) 0) (<= .cse45 .cse2) (= 0 .cse45) (not (< (+ .cse46 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse49 (div .cse47 5))) (let ((.cse48 (+ .cse49 1))) (and (not (= (mod .cse47 5) 0)) (not (< .cse48 0)) (< .cse49 0) (<= (mod .cse48 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse50 (div .cse52 10))) (let ((.cse51 (div (+ .cse50 1) 5))) (and (= (mod .cse50 5) 0) (= (mod (+ .cse51 1) 29) 0) (<= (mod (div .cse52 50) 29) .cse6) (= (mod .cse52 10) 0) (< .cse51 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse53 (div (+ (div .cse54 10) 1) 5)) (.cse55 (div .cse54 50))) (and (= (mod .cse53 29) 0) (not (= (mod .cse54 10) 0)) (<= (mod (+ .cse53 1) 29) .cse6) (= 0 (mod .cse55 29)) (< (+ .cse55 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse57 (div .cse56 50))) (and (= (mod (div .cse56 10) 5) 0) (<= (mod .cse57 29) .cse2) (<= 0 .cse57) (= (mod .cse56 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse59 (div .cse58 50))) (and (= (mod (div .cse58 10) 5) 0) (= (mod (+ .cse59 1) 29) 0) (<= (mod .cse59 29) .cse2) (not (< .cse59 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (+ (div .cse60 10) 1)) (.cse62 (div .cse60 50))) (and (not (= (mod .cse60 10) 0)) (<= (mod (div .cse61 5) 29) .cse6) (= 0 (mod .cse62 29)) (= (mod .cse61 5) 0) (< (+ .cse62 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse63 (div .cse64 50))) (and (<= (mod .cse63 29) .cse2) (= (mod (+ (div (+ (div .cse64 10) 1) 5) 1) 29) 0) (<= 0 .cse63))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse65 (div .cse66 50))) (and (<= (mod .cse65 29) .cse2) (= (mod (+ (div (+ (div .cse66 10) 1) 5) 1) 29) 0) (<= 0 .cse65) (= (mod .cse66 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse69 (div (+ (div .cse67 10) 1) 5))) (let ((.cse68 (mod (+ .cse69 1) 29))) (and (= (mod (+ (div .cse67 50) 1) 29) 0) (not (= (mod .cse67 10) 0)) (= .cse68 0) (< .cse69 0) (<= .cse68 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse71 (* 9 v_~a29~0_899))) (let ((.cse70 (div .cse71 50))) (and (= (mod (+ .cse70 1) 29) 0) (<= (mod .cse70 29) .cse2) (not (< (div .cse71 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse72 (div .cse74 10)) (.cse73 (div .cse74 50))) (and (= (mod .cse72 5) 0) (<= (mod .cse73 29) .cse2) (= (mod (+ (div (+ .cse72 1) 5) 1) 29) 0) (<= 0 .cse73))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse79 (+ (div .cse76 10) 1))) (let ((.cse78 (div .cse79 5))) (let ((.cse77 (mod .cse78 29)) (.cse75 (div .cse76 50))) (and (not (= 0 (mod .cse75 29))) (not (= (mod .cse76 10) 0)) (not (= .cse77 0)) (<= .cse77 .cse6) (not (= (mod (+ .cse78 1) 29) 0)) (= (mod .cse79 5) 0) (< (+ .cse75 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse81 (div .cse80 50))) (and (= (mod (div (+ (div .cse80 10) 1) 5) 29) 0) (<= (mod .cse81 29) .cse2) (<= 0 .cse81))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse82 50))) (let ((.cse83 (mod .cse84 29))) (and (= (mod (div .cse82 10) 5) 0) (<= .cse83 .cse2) (= 0 .cse83) (not (< (+ .cse84 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse85 (div (+ (div .cse86 10) 1) 5))) (and (<= 0 .cse85) (<= (mod .cse85 29) .cse2) (< .cse86 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse87 (mod (div (+ (div .cse88 10) 1) 5) 29))) (and (= .cse87 0) (<= .cse87 .cse2) (< .cse88 0) (not (< (+ (div .cse88 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse89 29) .cse2) (<= 0 .cse89)))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse91 (div .cse93 10))) (let ((.cse92 (div (+ .cse91 1) 5)) (.cse90 (mod (+ (div .cse93 50) 1) 29))) (and (= .cse90 0) (not (= (mod .cse91 5) 0)) (= (mod (+ .cse92 1) 29) 0) (= (mod .cse93 10) 0) (< .cse92 0) (<= .cse90 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse94 50))) (let ((.cse95 (mod .cse96 29))) (and (= (mod (div .cse94 10) 5) 0) (<= .cse95 .cse2) (= 0 .cse95) (= (mod .cse94 10) 0) (< (+ .cse96 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse97 (div .cse101 50))) (let ((.cse99 (div .cse101 10)) (.cse102 (+ .cse97 1))) (let ((.cse98 (mod .cse102 29)) (.cse100 (div (+ .cse99 1) 5))) (and (not (= 0 (mod .cse97 29))) (not (= .cse98 0)) (not (= (mod .cse99 5) 0)) (not (= (mod .cse100 29) 0)) (<= .cse98 .cse6) (= (mod .cse101 10) 0) (not (= (mod (+ .cse100 1) 29) 0)) (< .cse102 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse106 50))) (let ((.cse103 (div .cse106 10)) (.cse105 (+ .cse104 1))) (and (= (mod (div (+ .cse103 1) 5) 29) 0) (not (= (mod .cse103 5) 0)) (= 0 (mod .cse104 29)) (<= (mod .cse105 29) .cse6) (= (mod .cse106 10) 0) (< .cse105 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse108 50))) (let ((.cse107 (mod .cse109 29))) (and (<= .cse107 .cse2) (= 0 .cse107) (= (mod .cse108 10) 0) (not (< (+ .cse109 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse110 50))) (and (= (mod (div .cse110 10) 5) 0) (= (mod (+ .cse111 1) 29) 0) (<= (mod .cse111 29) .cse2) (not (< .cse111 0)) (= (mod .cse110 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse113 (div (+ (div .cse114 10) 1) 5))) (let ((.cse112 (mod .cse113 29))) (and (= .cse112 0) (not (< (+ .cse113 1) 0)) (<= .cse112 .cse2) (< .cse114 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse115 (div (+ (div .cse116 10) 1) 5))) (and (< .cse115 0) (<= (mod (+ .cse115 1) 29) .cse2) (not (< (+ (div .cse116 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse117 (div (+ (div .cse118 10) 1) 5))) (and (not (< (+ .cse117 1) 0)) (<= (mod .cse117 29) .cse6) (< (+ (div .cse118 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse119 (div .cse122 50))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5)) (.cse120 (+ .cse119 1))) (and (not (= 0 (mod .cse119 29))) (not (= (mod .cse120 29) 0)) (= (mod .cse121 29) 0) (not (= (mod .cse122 10) 0)) (<= (mod (+ .cse121 1) 29) .cse6) (< .cse120 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse123 (div .cse126 10))) (let ((.cse124 (div (+ .cse123 1) 5)) (.cse125 (div .cse126 50))) (and (= (mod .cse123 5) 0) (not (= (mod .cse124 29) 0)) (<= (mod .cse125 29) .cse6) (= (mod .cse126 10) 0) (not (= (mod (+ .cse124 1) 29) 0)) (< (+ .cse125 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse129 50)) (.cse127 (div .cse129 10))) (and (= (mod (div (+ .cse127 1) 5) 29) 0) (= (mod (+ .cse128 1) 29) 0) (<= (mod .cse128 29) .cse2) (not (< .cse127 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (div (+ (div .cse132 10) 1) 5)) (.cse130 (mod (+ (div .cse132 50) 1) 29))) (and (= .cse130 0) (not (= (mod .cse131 29) 0)) (= (mod .cse132 10) 0) (not (= (mod (+ .cse131 1) 29) 0)) (<= .cse130 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse134 10))) (let ((.cse135 (div (+ .cse133 1) 5))) (and (= (mod .cse133 5) 0) (<= (mod (div .cse134 50) 29) .cse2) (= (mod (+ .cse135 1) 29) 0) (= (mod .cse134 10) 0) (not (< .cse135 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse138 10)) (.cse137 (div .cse138 50))) (and (= (mod .cse136 5) 0) (<= (mod .cse137 29) .cse2) (= (mod (+ (div (+ .cse136 1) 5) 1) 29) 0) (<= 0 .cse137) (= (mod .cse138 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse139 (+ (div .cse140 10) 1))) (and (not (< .cse139 0)) (<= (mod (div .cse139 5) 29) .cse2) (< .cse140 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse142 10)) (.cse141 (mod (+ (div .cse142 50) 1) 29))) (and (= .cse141 0) (= (mod .cse142 10) 0) (not (= (mod (+ (div (+ .cse143 1) 5) 1) 29) 0)) (< .cse143 0) (<= .cse141 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse144 50))) (let ((.cse145 (mod .cse146 29))) (and (= (mod (div .cse144 10) 5) 0) (<= .cse145 .cse2) (= 0 .cse145) (= (mod .cse144 10) 0) (not (< (+ .cse146 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse148 50))) (and (<= (mod .cse147 29) .cse2) (<= 0 .cse147) (= (mod .cse148 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse152 (+ (div .cse151 10) 1))) (let ((.cse149 (div .cse151 50)) (.cse153 (div .cse152 5))) (let ((.cse154 (mod (+ .cse153 1) 29)) (.cse150 (+ .cse149 1))) (and (not (= 0 (mod .cse149 29))) (not (= (mod .cse150 29) 0)) (not (= (mod .cse151 10) 0)) (not (= (mod .cse152 5) 0)) (not (= (mod .cse153 29) 0)) (<= .cse154 .cse6) (not (= .cse154 0)) (< .cse150 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse156 (* 9 v_~a29~0_899))) (let ((.cse157 (div (+ (div .cse156 10) 1) 5))) (let ((.cse155 (mod .cse157 29))) (and (= .cse155 0) (= (mod (+ (div .cse156 50) 1) 29) 0) (not (= (mod .cse156 10) 0)) (< (+ .cse157 1) 0) (<= .cse155 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse158 (* 9 v_~a29~0_899))) (let ((.cse159 (div .cse158 50))) (and (= (mod (div .cse158 10) 5) 0) (<= (mod .cse159 29) .cse2) (<= 0 .cse159))))))) is different from true [2022-11-18 20:07:26,828 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse8 (* 9 v_~a29~0_899))) (let ((.cse10 (+ (div .cse8 10) 1))) (let ((.cse9 (div .cse10 5))) (and (not (= (mod .cse8 10) 0)) (= (mod (+ .cse9 1) 29) 0) (<= (mod .cse9 29) .cse6) (= (mod .cse10 5) 0) (< (+ (div .cse8 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (div (+ .cse11 1) 5))) (and (= (mod .cse11 5) 0) (= (mod .cse12 29) 0) (<= (mod (div .cse13 50) 29) .cse2) (= (mod .cse13 10) 0) (<= 0 (+ .cse12 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (div (+ .cse14 1) 5))) (and (= (mod .cse14 5) 0) (= (mod .cse15 29) 0) (<= (mod (div .cse16 50) 29) .cse2) (<= 0 (+ .cse15 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse17 (+ (div .cse18 10) 1))) (and (<= (mod (div .cse17 5) 29) .cse2) (< .cse18 0) (= (mod .cse17 5) 0) (not (< (+ (div .cse18 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse19 50))) (let ((.cse20 (mod .cse21 29))) (and (= (mod (div (+ (div .cse19 10) 1) 5) 29) 0) (<= .cse20 .cse2) (= 0 .cse20) (= (mod .cse19 10) 0) (not (< (+ .cse21 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (div (* 9 v_~a29~0_899) 50))) (let ((.cse22 (mod .cse23 29))) (and (<= .cse22 .cse2) (= 0 .cse22) (not (< (+ .cse23 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 50)) (.cse25 (div (+ (div .cse26 10) 1) 5))) (and (= (mod (+ .cse24 1) 29) 0) (<= (mod .cse24 29) .cse2) (= (mod (+ .cse25 1) 29) 0) (= (mod .cse26 10) 0) (not (< .cse25 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (div .cse28 10))) (let ((.cse29 (div (+ .cse27 1) 5))) (and (= (mod .cse27 5) 0) (<= (mod (div .cse28 50) 29) .cse2) (= (mod (+ .cse29 1) 29) 0) (not (< .cse29 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod .cse33 29) 0) (<= (mod (div .cse34 50) 29) .cse2) (= (mod .cse34 10) 0) (<= 0 (+ .cse33 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse36 50))) (and (= (mod (+ .cse35 1) 29) 0) (<= (mod .cse35 29) .cse2) (not (< (div .cse36 10) 0)) (= (mod .cse36 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse39 50)) (.cse37 (div .cse39 10))) (and (= (mod (div (+ .cse37 1) 5) 29) 0) (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (not (< .cse37 0)) (= (mod .cse39 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse40 50))) (let ((.cse41 (mod .cse42 29))) (and (= (mod (div (+ (div .cse40 10) 1) 5) 29) 0) (<= .cse41 .cse2) (= 0 .cse41) (not (< (+ .cse42 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse45 (div .cse43 5))) (let ((.cse44 (+ .cse45 1))) (and (not (= (mod .cse43 5) 0)) (not (< .cse44 0)) (< .cse45 0) (<= (mod .cse44 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse48 10))) (let ((.cse47 (div (+ .cse46 1) 5))) (and (= (mod .cse46 5) 0) (= (mod (+ .cse47 1) 29) 0) (<= (mod (div .cse48 50) 29) .cse6) (= (mod .cse48 10) 0) (< .cse47 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse49 (div (+ (div .cse50 10) 1) 5)) (.cse51 (div .cse50 50))) (and (= (mod .cse49 29) 0) (not (= (mod .cse50 10) 0)) (<= (mod (+ .cse49 1) 29) .cse6) (= 0 (mod .cse51 29)) (< (+ .cse51 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse53 (div .cse52 50))) (and (= (mod (div .cse52 10) 5) 0) (<= (mod .cse53 29) .cse2) (<= 0 .cse53) (= (mod .cse52 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse54 50))) (and (= (mod (div .cse54 10) 5) 0) (= (mod (+ .cse55 1) 29) 0) (<= (mod .cse55 29) .cse2) (not (< .cse55 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse57 (+ (div .cse56 10) 1)) (.cse58 (div .cse56 50))) (and (not (= (mod .cse56 10) 0)) (<= (mod (div .cse57 5) 29) .cse6) (= 0 (mod .cse58 29)) (= (mod .cse57 5) 0) (< (+ .cse58 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse59 (div .cse60 50))) (and (<= (mod .cse59 29) .cse2) (= (mod (+ (div (+ (div .cse60 10) 1) 5) 1) 29) 0) (<= 0 .cse59))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse61 (div .cse62 50))) (and (<= (mod .cse61 29) .cse2) (= (mod (+ (div (+ (div .cse62 10) 1) 5) 1) 29) 0) (<= 0 .cse61) (= (mod .cse62 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse65 (div (+ (div .cse63 10) 1) 5))) (let ((.cse64 (mod (+ .cse65 1) 29))) (and (= (mod (+ (div .cse63 50) 1) 29) 0) (not (= (mod .cse63 10) 0)) (= .cse64 0) (< .cse65 0) (<= .cse64 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (= (mod (+ .cse66 1) 29) 0) (<= (mod .cse66 29) .cse2) (not (< (div .cse67 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse70 10)) (.cse69 (div .cse70 50))) (and (= (mod .cse68 5) 0) (<= (mod .cse69 29) .cse2) (= (mod (+ (div (+ .cse68 1) 5) 1) 29) 0) (<= 0 .cse69))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse75 (+ (div .cse72 10) 1))) (let ((.cse74 (div .cse75 5))) (let ((.cse73 (mod .cse74 29)) (.cse71 (div .cse72 50))) (and (not (= 0 (mod .cse71 29))) (not (= (mod .cse72 10) 0)) (not (= .cse73 0)) (<= .cse73 .cse6) (not (= (mod (+ .cse74 1) 29) 0)) (= (mod .cse75 5) 0) (< (+ .cse71 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse76 50))) (and (= (mod (div (+ (div .cse76 10) 1) 5) 29) 0) (<= (mod .cse77 29) .cse2) (<= 0 .cse77))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse80 50)) (.cse79 (div (+ (div .cse80 10) 1) 5))) (and (not (= 0 (mod .cse78 29))) (not (= (mod (+ .cse78 1) 29) 0)) (= (mod .cse79 29) 0) (not (= (mod .cse80 10) 0)) (<= (mod (+ .cse79 1) 29) .cse6))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse83 (div .cse81 50))) (let ((.cse82 (mod .cse83 29))) (and (= (mod (div .cse81 10) 5) 0) (<= .cse82 .cse2) (= 0 .cse82) (not (< (+ .cse83 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse84 (div (+ (div .cse85 10) 1) 5))) (and (<= 0 .cse84) (<= (mod .cse84 29) .cse2) (< .cse85 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (mod (div (+ (div .cse87 10) 1) 5) 29))) (and (= .cse86 0) (<= .cse86 .cse2) (< .cse87 0) (not (< (+ (div .cse87 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse88 29) .cse2) (<= 0 .cse88)))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse90 (div .cse92 10))) (let ((.cse91 (div (+ .cse90 1) 5)) (.cse89 (mod (+ (div .cse92 50) 1) 29))) (and (= .cse89 0) (not (= (mod .cse90 5) 0)) (= (mod (+ .cse91 1) 29) 0) (= (mod .cse92 10) 0) (< .cse91 0) (<= .cse89 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse95 (div .cse93 50))) (let ((.cse94 (mod .cse95 29))) (and (= (mod (div .cse93 10) 5) 0) (<= .cse94 .cse2) (= 0 .cse94) (= (mod .cse93 10) 0) (< (+ .cse95 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse100 50))) (let ((.cse98 (div .cse100 10)) (.cse101 (+ .cse96 1))) (let ((.cse97 (mod .cse101 29)) (.cse99 (div (+ .cse98 1) 5))) (and (not (= 0 (mod .cse96 29))) (not (= .cse97 0)) (not (= (mod .cse98 5) 0)) (not (= (mod .cse99 29) 0)) (<= .cse97 .cse6) (= (mod .cse100 10) 0) (not (= (mod (+ .cse99 1) 29) 0)) (< .cse101 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse105 50))) (let ((.cse102 (div .cse105 10)) (.cse104 (+ .cse103 1))) (and (= (mod (div (+ .cse102 1) 5) 29) 0) (not (= (mod .cse102 5) 0)) (= 0 (mod .cse103 29)) (<= (mod .cse104 29) .cse6) (= (mod .cse105 10) 0) (< .cse104 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse107 50))) (let ((.cse106 (mod .cse108 29))) (and (<= .cse106 .cse2) (= 0 .cse106) (= (mod .cse107 10) 0) (not (< (+ .cse108 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse109 50))) (let ((.cse111 (+ .cse110 1))) (and (not (= (mod (div (+ (div .cse109 10) 1) 5) 29) 0)) (= 0 (mod .cse110 29)) (<= (mod .cse111 29) .cse6) (= (mod .cse109 10) 0) (< .cse111 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (and (= (mod (div .cse112 10) 5) 0) (= (mod (+ .cse113 1) 29) 0) (<= (mod .cse113 29) .cse2) (not (< .cse113 0)) (= (mod .cse112 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse115 (div (+ (div .cse116 10) 1) 5))) (let ((.cse114 (mod .cse115 29))) (and (= .cse114 0) (not (< (+ .cse115 1) 0)) (<= .cse114 .cse2) (< .cse116 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse117 (div (+ (div .cse118 10) 1) 5))) (and (< .cse117 0) (<= (mod (+ .cse117 1) 29) .cse2) (not (< (+ (div .cse118 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse119 (div (+ (div .cse120 10) 1) 5))) (and (not (< (+ .cse119 1) 0)) (<= (mod .cse119 29) .cse6) (< (+ (div .cse120 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse124 10))) (let ((.cse122 (div (+ .cse121 1) 5)) (.cse123 (div .cse124 50))) (and (= (mod .cse121 5) 0) (not (= (mod .cse122 29) 0)) (<= (mod .cse123 29) .cse6) (= (mod .cse124 10) 0) (not (= (mod (+ .cse122 1) 29) 0)) (< (+ .cse123 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div .cse127 50)) (.cse125 (div .cse127 10))) (and (= (mod (div (+ .cse125 1) 5) 29) 0) (= (mod (+ .cse126 1) 29) 0) (<= (mod .cse126 29) .cse2) (not (< .cse125 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse129 10))) (let ((.cse130 (div (+ .cse128 1) 5))) (and (= (mod .cse128 5) 0) (<= (mod (div .cse129 50) 29) .cse2) (= (mod (+ .cse130 1) 29) 0) (= (mod .cse129 10) 0) (not (< .cse130 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse133 10)) (.cse132 (div .cse133 50))) (and (= (mod .cse131 5) 0) (<= (mod .cse132 29) .cse2) (= (mod (+ (div (+ .cse131 1) 5) 1) 29) 0) (<= 0 .cse132) (= (mod .cse133 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse134 (+ (div .cse135 10) 1))) (and (not (< .cse134 0)) (<= (mod (div .cse134 5) 29) .cse2) (< .cse135 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse137 10)) (.cse136 (mod (+ (div .cse137 50) 1) 29))) (and (= .cse136 0) (= (mod .cse137 10) 0) (not (= (mod (+ (div (+ .cse138 1) 5) 1) 29) 0)) (< .cse138 0) (<= .cse136 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse141 (div .cse139 50))) (let ((.cse140 (mod .cse141 29))) (and (= (mod (div .cse139 10) 5) 0) (<= .cse140 .cse2) (= 0 .cse140) (= (mod .cse139 10) 0) (not (< (+ .cse141 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse143 50))) (and (<= (mod .cse142 29) .cse2) (<= 0 .cse142) (= (mod .cse143 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse147 (+ (div .cse146 10) 1))) (let ((.cse144 (div .cse146 50)) (.cse148 (div .cse147 5))) (let ((.cse149 (mod (+ .cse148 1) 29)) (.cse145 (+ .cse144 1))) (and (not (= 0 (mod .cse144 29))) (not (= (mod .cse145 29) 0)) (not (= (mod .cse146 10) 0)) (not (= (mod .cse147 5) 0)) (not (= (mod .cse148 29) 0)) (<= .cse149 .cse6) (not (= .cse149 0)) (< .cse145 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse152 (div (+ (div .cse151 10) 1) 5))) (let ((.cse150 (mod .cse152 29))) (and (= .cse150 0) (= (mod (+ (div .cse151 50) 1) 29) 0) (not (= (mod .cse151 10) 0)) (< (+ .cse152 1) 0) (<= .cse150 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse154 (div .cse153 50))) (and (= (mod (div .cse153 10) 5) 0) (<= (mod .cse154 29) .cse2) (<= 0 .cse154))))))) is different from true [2022-11-18 20:08:21,936 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse8 (* 9 v_~a29~0_899))) (let ((.cse10 (+ (div .cse8 10) 1))) (let ((.cse9 (div .cse10 5))) (and (not (= (mod .cse8 10) 0)) (= (mod (+ .cse9 1) 29) 0) (<= (mod .cse9 29) .cse6) (= (mod .cse10 5) 0) (< (+ (div .cse8 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (div (+ .cse11 1) 5))) (and (= (mod .cse11 5) 0) (= (mod .cse12 29) 0) (<= (mod (div .cse13 50) 29) .cse2) (= (mod .cse13 10) 0) (<= 0 (+ .cse12 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse16 (* 9 v_~a29~0_899))) (let ((.cse14 (div .cse16 10))) (let ((.cse15 (div (+ .cse14 1) 5))) (and (= (mod .cse14 5) 0) (= (mod .cse15 29) 0) (<= (mod (div .cse16 50) 29) .cse2) (<= 0 (+ .cse15 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse17 (+ (div .cse18 10) 1))) (and (<= (mod (div .cse17 5) 29) .cse2) (< .cse18 0) (= (mod .cse17 5) 0) (not (< (+ (div .cse18 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse19 50))) (let ((.cse20 (mod .cse21 29))) (and (= (mod (div (+ (div .cse19 10) 1) 5) 29) 0) (<= .cse20 .cse2) (= 0 .cse20) (= (mod .cse19 10) 0) (not (< (+ .cse21 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (div (* 9 v_~a29~0_899) 50))) (let ((.cse22 (mod .cse23 29))) (and (<= .cse22 .cse2) (= 0 .cse22) (not (< (+ .cse23 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 50)) (.cse25 (div (+ (div .cse26 10) 1) 5))) (and (= (mod (+ .cse24 1) 29) 0) (<= (mod .cse24 29) .cse2) (= (mod (+ .cse25 1) 29) 0) (= (mod .cse26 10) 0) (not (< .cse25 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (div .cse28 10))) (let ((.cse29 (div (+ .cse27 1) 5))) (and (= (mod .cse27 5) 0) (<= (mod (div .cse28 50) 29) .cse2) (= (mod (+ .cse29 1) 29) 0) (not (< .cse29 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod .cse33 29) 0) (<= (mod (div .cse34 50) 29) .cse2) (= (mod .cse34 10) 0) (<= 0 (+ .cse33 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse36 50))) (and (= (mod (+ .cse35 1) 29) 0) (<= (mod .cse35 29) .cse2) (not (< (div .cse36 10) 0)) (= (mod .cse36 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse39 50)) (.cse37 (div .cse39 10))) (and (= (mod (div (+ .cse37 1) 5) 29) 0) (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (not (< .cse37 0)) (= (mod .cse39 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse40 50))) (let ((.cse41 (mod .cse42 29))) (and (= (mod (div (+ (div .cse40 10) 1) 5) 29) 0) (<= .cse41 .cse2) (= 0 .cse41) (not (< (+ .cse42 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse45 (div .cse43 5))) (let ((.cse44 (+ .cse45 1))) (and (not (= (mod .cse43 5) 0)) (not (< .cse44 0)) (< .cse45 0) (<= (mod .cse44 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse48 10))) (let ((.cse47 (div (+ .cse46 1) 5))) (and (= (mod .cse46 5) 0) (= (mod (+ .cse47 1) 29) 0) (<= (mod (div .cse48 50) 29) .cse6) (= (mod .cse48 10) 0) (< .cse47 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse49 (div (+ (div .cse50 10) 1) 5)) (.cse51 (div .cse50 50))) (and (= (mod .cse49 29) 0) (not (= (mod .cse50 10) 0)) (<= (mod (+ .cse49 1) 29) .cse6) (= 0 (mod .cse51 29)) (< (+ .cse51 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse53 (div .cse52 50))) (and (= (mod (div .cse52 10) 5) 0) (<= (mod .cse53 29) .cse2) (<= 0 .cse53) (= (mod .cse52 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse54 50))) (and (= (mod (div .cse54 10) 5) 0) (= (mod (+ .cse55 1) 29) 0) (<= (mod .cse55 29) .cse2) (not (< .cse55 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse57 (+ (div .cse56 10) 1)) (.cse58 (div .cse56 50))) (and (not (= (mod .cse56 10) 0)) (<= (mod (div .cse57 5) 29) .cse6) (= 0 (mod .cse58 29)) (= (mod .cse57 5) 0) (< (+ .cse58 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse59 (div .cse60 50))) (and (<= (mod .cse59 29) .cse2) (= (mod (+ (div (+ (div .cse60 10) 1) 5) 1) 29) 0) (<= 0 .cse59))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse61 (div .cse62 50))) (and (<= (mod .cse61 29) .cse2) (= (mod (+ (div (+ (div .cse62 10) 1) 5) 1) 29) 0) (<= 0 .cse61) (= (mod .cse62 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse65 (div (+ (div .cse63 10) 1) 5))) (let ((.cse64 (mod (+ .cse65 1) 29))) (and (= (mod (+ (div .cse63 50) 1) 29) 0) (not (= (mod .cse63 10) 0)) (= .cse64 0) (< .cse65 0) (<= .cse64 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (= (mod (+ .cse66 1) 29) 0) (<= (mod .cse66 29) .cse2) (not (< (div .cse67 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse70 10)) (.cse69 (div .cse70 50))) (and (= (mod .cse68 5) 0) (<= (mod .cse69 29) .cse2) (= (mod (+ (div (+ .cse68 1) 5) 1) 29) 0) (<= 0 .cse69))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse75 (+ (div .cse72 10) 1))) (let ((.cse74 (div .cse75 5))) (let ((.cse73 (mod .cse74 29)) (.cse71 (div .cse72 50))) (and (not (= 0 (mod .cse71 29))) (not (= (mod .cse72 10) 0)) (not (= .cse73 0)) (<= .cse73 .cse6) (not (= (mod (+ .cse74 1) 29) 0)) (= (mod .cse75 5) 0) (< (+ .cse71 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse76 50))) (and (= (mod (div (+ (div .cse76 10) 1) 5) 29) 0) (<= (mod .cse77 29) .cse2) (<= 0 .cse77))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse78 50))) (let ((.cse79 (mod .cse80 29))) (and (= (mod (div .cse78 10) 5) 0) (<= .cse79 .cse2) (= 0 .cse79) (not (< (+ .cse80 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse81 (div (+ (div .cse82 10) 1) 5))) (and (<= 0 .cse81) (<= (mod .cse81 29) .cse2) (< .cse82 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse83 (mod (div (+ (div .cse84 10) 1) 5) 29))) (and (= .cse83 0) (<= .cse83 .cse2) (< .cse84 0) (not (< (+ (div .cse84 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse85 29) .cse2) (<= 0 .cse85)))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse87 (div .cse89 10))) (let ((.cse88 (div (+ .cse87 1) 5)) (.cse86 (mod (+ (div .cse89 50) 1) 29))) (and (= .cse86 0) (not (= (mod .cse87 5) 0)) (= (mod (+ .cse88 1) 29) 0) (= (mod .cse89 10) 0) (< .cse88 0) (<= .cse86 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse90 50))) (let ((.cse91 (mod .cse92 29))) (and (= (mod (div .cse90 10) 5) 0) (<= .cse91 .cse2) (= 0 .cse91) (= (mod .cse90 10) 0) (< (+ .cse92 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse97 50))) (let ((.cse95 (div .cse97 10)) (.cse98 (+ .cse93 1))) (let ((.cse94 (mod .cse98 29)) (.cse96 (div (+ .cse95 1) 5))) (and (not (= 0 (mod .cse93 29))) (not (= .cse94 0)) (not (= (mod .cse95 5) 0)) (not (= (mod .cse96 29) 0)) (<= .cse94 .cse6) (= (mod .cse97 10) 0) (not (= (mod (+ .cse96 1) 29) 0)) (< .cse98 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse100 (div .cse102 50))) (let ((.cse99 (div .cse102 10)) (.cse101 (+ .cse100 1))) (and (= (mod (div (+ .cse99 1) 5) 29) 0) (not (= (mod .cse99 5) 0)) (= 0 (mod .cse100 29)) (<= (mod .cse101 29) .cse6) (= (mod .cse102 10) 0) (< .cse101 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse104 50))) (let ((.cse103 (mod .cse105 29))) (and (<= .cse103 .cse2) (= 0 .cse103) (= (mod .cse104 10) 0) (not (< (+ .cse105 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse106 50))) (let ((.cse108 (+ .cse107 1))) (and (not (= (mod (div (+ (div .cse106 10) 1) 5) 29) 0)) (= 0 (mod .cse107 29)) (<= (mod .cse108 29) .cse6) (= (mod .cse106 10) 0) (< .cse108 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse109 50))) (and (= (mod (div .cse109 10) 5) 0) (= (mod (+ .cse110 1) 29) 0) (<= (mod .cse110 29) .cse2) (not (< .cse110 0)) (= (mod .cse109 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse112 (div (+ (div .cse113 10) 1) 5))) (let ((.cse111 (mod .cse112 29))) (and (= .cse111 0) (not (< (+ .cse112 1) 0)) (<= .cse111 .cse2) (< .cse113 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse114 (div (+ (div .cse115 10) 1) 5))) (and (< .cse114 0) (<= (mod (+ .cse114 1) 29) .cse2) (not (< (+ (div .cse115 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse116 (div (+ (div .cse117 10) 1) 5))) (and (not (< (+ .cse116 1) 0)) (<= (mod .cse116 29) .cse6) (< (+ (div .cse117 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse121 10))) (let ((.cse119 (div (+ .cse118 1) 5)) (.cse120 (div .cse121 50))) (and (= (mod .cse118 5) 0) (not (= (mod .cse119 29) 0)) (<= (mod .cse120 29) .cse6) (= (mod .cse121 10) 0) (not (= (mod (+ .cse119 1) 29) 0)) (< (+ .cse120 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div .cse124 50)) (.cse122 (div .cse124 10))) (and (= (mod (div (+ .cse122 1) 5) 29) 0) (= (mod (+ .cse123 1) 29) 0) (<= (mod .cse123 29) .cse2) (not (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div .cse126 10))) (let ((.cse127 (div (+ .cse125 1) 5))) (and (= (mod .cse125 5) 0) (<= (mod (div .cse126 50) 29) .cse2) (= (mod (+ .cse127 1) 29) 0) (= (mod .cse126 10) 0) (not (< .cse127 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse130 10)) (.cse129 (div .cse130 50))) (and (= (mod .cse128 5) 0) (<= (mod .cse129 29) .cse2) (= (mod (+ (div (+ .cse128 1) 5) 1) 29) 0) (<= 0 .cse129) (= (mod .cse130 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (+ (div .cse132 10) 1))) (and (not (< .cse131 0)) (<= (mod (div .cse131 5) 29) .cse2) (< .cse132 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse134 10)) (.cse133 (mod (+ (div .cse134 50) 1) 29))) (and (= .cse133 0) (= (mod .cse134 10) 0) (not (= (mod (+ (div (+ .cse135 1) 5) 1) 29) 0)) (< .cse135 0) (<= .cse133 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse136 50))) (let ((.cse137 (mod .cse138 29))) (and (= (mod (div .cse136 10) 5) 0) (<= .cse137 .cse2) (= 0 .cse137) (= (mod .cse136 10) 0) (not (< (+ .cse138 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse139 (div .cse140 50))) (and (<= (mod .cse139 29) .cse2) (<= 0 .cse139) (= (mod .cse140 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse144 (+ (div .cse143 10) 1))) (let ((.cse141 (div .cse143 50)) (.cse145 (div .cse144 5))) (let ((.cse146 (mod (+ .cse145 1) 29)) (.cse142 (+ .cse141 1))) (and (not (= 0 (mod .cse141 29))) (not (= (mod .cse142 29) 0)) (not (= (mod .cse143 10) 0)) (not (= (mod .cse144 5) 0)) (not (= (mod .cse145 29) 0)) (<= .cse146 .cse6) (not (= .cse146 0)) (< .cse142 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (div (+ (div .cse148 10) 1) 5))) (let ((.cse147 (mod .cse149 29))) (and (= .cse147 0) (= (mod (+ (div .cse148 50) 1) 29) 0) (not (= (mod .cse148 10) 0)) (< (+ .cse149 1) 0) (<= .cse147 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse150 50))) (and (= (mod (div .cse150 10) 5) 0) (<= (mod .cse151 29) .cse2) (<= 0 .cse151))))))) is different from true