./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:30:13,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:13,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:13,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:13,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:13,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:13,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:13,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:13,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:13,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:13,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:13,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:13,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:13,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:13,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:13,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:13,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:13,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:13,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:13,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:13,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:13,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:13,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:13,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:13,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:13,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:13,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:13,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:13,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:13,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:13,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:13,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:13,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:13,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:13,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:13,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:13,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:13,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:13,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:13,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:13,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:13,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:30:13,861 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:13,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:13,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:13,862 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:13,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:30:13,863 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:30:13,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:13,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:13,865 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:13,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:13,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:30:13,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:30:13,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:30:13,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:13,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:30:13,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:30:13,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:30:13,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:30:13,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:30:13,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:13,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:30:13,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:13,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:13,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:30:13,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:13,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:13,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:30:13,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:30:13,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:30:13,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:30:13,872 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:30:13,872 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:30:13,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:30:13,873 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_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f [2022-11-20 09:30:14,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:14,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:14,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:14,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:14,216 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:14,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-20 09:30:17,275 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:17,772 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:17,772 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-20 09:30:17,796 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/data/f29a53828/2a58d8bc7d1244b1bcdc6b63219b851c/FLAG9bf1e502d [2022-11-20 09:30:17,814 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/data/f29a53828/2a58d8bc7d1244b1bcdc6b63219b851c [2022-11-20 09:30:17,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:17,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:17,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:17,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:17,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:17,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:17" (1/1) ... [2022-11-20 09:30:17,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aaa1403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:17, skipping insertion in model container [2022-11-20 09:30:17,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:17" (1/1) ... [2022-11-20 09:30:17,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:30:17,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:30:18,194 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-20 09:30:18,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:18,744 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:30:18,769 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-20 09:30:19,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:19,096 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:30:19,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19 WrapperNode [2022-11-20 09:30:19,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:19,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:19,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:30:19,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:30:19,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,319 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-20 09:30:19,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:19,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:30:19,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:30:19,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:30:19,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:30:19,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:30:19,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:30:19,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:30:19,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:19,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:30:19,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:30:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:30:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:30:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:30:19,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:30:19,815 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:30:19,818 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:30:23,611 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:30:23,627 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:30:23,627 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:30:23,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:23 BoogieIcfgContainer [2022-11-20 09:30:23,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:30:23,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:30:23,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:30:23,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:30:23,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:30:17" (1/3) ... [2022-11-20 09:30:23,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5cf378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:23, skipping insertion in model container [2022-11-20 09:30:23,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19" (2/3) ... [2022-11-20 09:30:23,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5cf378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:23, skipping insertion in model container [2022-11-20 09:30:23,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:23" (3/3) ... [2022-11-20 09:30:23,645 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2022-11-20 09:30:23,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:30:23,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:30:23,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:30:23,738 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;@aa64621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:30:23,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:30:23,749 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-20 09:30:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:30:23,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:23,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:23,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2022-11-20 09:30:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:23,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406255515] [2022-11-20 09:30:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:24,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406255515] [2022-11-20 09:30:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406255515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:24,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:24,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984315296] [2022-11-20 09:30:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:24,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:24,295 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 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:26,979 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-20 09:30:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 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 57 [2022-11-20 09:30:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:26,997 INFO L225 Difference]: With dead ends: 1155 [2022-11-20 09:30:26,998 INFO L226 Difference]: Without dead ends: 667 [2022-11-20 09:30:27,002 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-20 09:30:27,006 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 287 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:27,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 09:30:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-20 09:30:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-20 09:30:27,076 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-20 09:30:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-20 09:30:27,080 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 57 [2022-11-20 09:30:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:27,081 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-20 09:30:27,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-20 09:30:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 09:30:27,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:27,086 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, 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] [2022-11-20 09:30:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:30:27,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash -664289441, now seen corresponding path program 1 times [2022-11-20 09:30:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:27,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040234917] [2022-11-20 09:30:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040234917] [2022-11-20 09:30:27,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040234917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:27,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:27,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707858251] [2022-11-20 09:30:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:27,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:27,330 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:30,120 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-20 09:30:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:30,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2022-11-20 09:30:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:30,126 INFO L225 Difference]: With dead ends: 1953 [2022-11-20 09:30:30,126 INFO L226 Difference]: Without dead ends: 1290 [2022-11-20 09:30:30,128 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-20 09:30:30,130 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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-20 09:30:30,130 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-20 09:30:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-20 09:30:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-20 09:30:30,171 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-20 09:30:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-20 09:30:30,176 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 132 [2022-11-20 09:30:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:30,177 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-20 09:30:30,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-20 09:30:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 09:30:30,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:30,183 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, 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] [2022-11-20 09:30:30,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:30:30,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 22508777, now seen corresponding path program 1 times [2022-11-20 09:30:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:30,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730443179] [2022-11-20 09:30:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:30,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730443179] [2022-11-20 09:30:30,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730443179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:30,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126344569] [2022-11-20 09:30:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:30,531 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:33,015 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-20 09:30:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-11-20 09:30:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:33,025 INFO L225 Difference]: With dead ends: 3764 [2022-11-20 09:30:33,026 INFO L226 Difference]: Without dead ends: 2484 [2022-11-20 09:30:33,028 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-20 09:30:33,029 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:33,030 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.4s Time] [2022-11-20 09:30:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-20 09:30:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-20 09:30:33,076 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-20 09:30:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-20 09:30:33,082 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 136 [2022-11-20 09:30:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:33,083 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-20 09:30:33,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-20 09:30:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-20 09:30:33,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:33,089 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:30:33,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1359144620, now seen corresponding path program 1 times [2022-11-20 09:30:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264184476] [2022-11-20 09:30:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:33,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-20 09:30:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:33,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264184476] [2022-11-20 09:30:33,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264184476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:33,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:33,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851461546] [2022-11-20 09:30:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:33,587 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:35,648 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-20 09:30:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:35,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 227 [2022-11-20 09:30:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:35,667 INFO L225 Difference]: With dead ends: 6166 [2022-11-20 09:30:35,667 INFO L226 Difference]: Without dead ends: 3986 [2022-11-20 09:30:35,671 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-20 09:30:35,682 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-20 09:30:35,683 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-20 09:30:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-20 09:30:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-20 09:30:35,796 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-20 09:30:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-20 09:30:35,809 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 227 [2022-11-20 09:30:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:35,811 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-20 09:30:35,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-20 09:30:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-11-20 09:30:35,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:35,821 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:30:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:30:35,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash -764479700, now seen corresponding path program 1 times [2022-11-20 09:30:35,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:35,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916367120] [2022-11-20 09:30:35,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:35,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 09:30:36,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:36,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916367120] [2022-11-20 09:30:36,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916367120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:36,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:36,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624453350] [2022-11-20 09:30:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:36,704 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-20 09:30:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:39,185 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-20 09:30:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:39,186 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 329 [2022-11-20 09:30:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:39,203 INFO L225 Difference]: With dead ends: 7661 [2022-11-20 09:30:39,203 INFO L226 Difference]: Without dead ends: 3981 [2022-11-20 09:30:39,207 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-20 09:30:39,213 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:39,214 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.4s Time] [2022-11-20 09:30:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-20 09:30:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-20 09:30:39,285 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-20 09:30:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-20 09:30:39,294 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 329 [2022-11-20 09:30:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:39,296 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-20 09:30:39,297 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-20 09:30:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-20 09:30:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-11-20 09:30:39,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:39,306 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:30:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:30:39,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1396325859, now seen corresponding path program 1 times [2022-11-20 09:30:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:39,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387212552] [2022-11-20 09:30:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-20 09:30:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:39,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387212552] [2022-11-20 09:30:39,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387212552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:39,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975045503] [2022-11-20 09:30:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:39,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:39,690 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:41,965 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-20 09:30:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 344 [2022-11-20 09:30:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:41,990 INFO L225 Difference]: With dead ends: 9465 [2022-11-20 09:30:41,990 INFO L226 Difference]: Without dead ends: 5785 [2022-11-20 09:30:41,995 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-20 09:30:41,996 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 259 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 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-20 09:30:41,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 09:30:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-20 09:30:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-20 09:30:42,100 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-20 09:30:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-20 09:30:42,113 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 344 [2022-11-20 09:30:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:42,114 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-20 09:30:42,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-20 09:30:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-20 09:30:42,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:42,123 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:30:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:30:42,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1074223962, now seen corresponding path program 1 times [2022-11-20 09:30:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:42,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106987688] [2022-11-20 09:30:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-20 09:30:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106987688] [2022-11-20 09:30:42,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106987688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:42,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:42,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531836509] [2022-11-20 09:30:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:42,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:42,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:42,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:42,646 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:44,800 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-20 09:30:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 403 [2022-11-20 09:30:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:44,832 INFO L225 Difference]: With dead ends: 13364 [2022-11-20 09:30:44,832 INFO L226 Difference]: Without dead ends: 7882 [2022-11-20 09:30:44,838 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-20 09:30:44,840 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 09:30:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-20 09:30:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-20 09:30:45,000 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-20 09:30:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-20 09:30:45,022 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 403 [2022-11-20 09:30:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:45,023 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-20 09:30:45,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-20 09:30:45,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-11-20 09:30:45,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:45,033 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:30:45,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:30:45,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1496156917, now seen corresponding path program 1 times [2022-11-20 09:30:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:45,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954393673] [2022-11-20 09:30:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-20 09:30:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:45,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954393673] [2022-11-20 09:30:45,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954393673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:45,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:45,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606731680] [2022-11-20 09:30:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:45,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:45,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:45,412 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:47,735 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-20 09:30:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:47,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 418 [2022-11-20 09:30:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:47,758 INFO L225 Difference]: With dead ends: 16069 [2022-11-20 09:30:47,759 INFO L226 Difference]: Without dead ends: 9086 [2022-11-20 09:30:47,764 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-20 09:30:47,765 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 272 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:47,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-20 09:30:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-20 09:30:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-20 09:30:47,892 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-20 09:30:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-20 09:30:47,907 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 418 [2022-11-20 09:30:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:47,908 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-20 09:30:47,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-20 09:30:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2022-11-20 09:30:47,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:47,920 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 09:30:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:30:47,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1478191957, now seen corresponding path program 1 times [2022-11-20 09:30:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:47,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871786174] [2022-11-20 09:30:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-20 09:30:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871786174] [2022-11-20 09:30:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871786174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:48,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:48,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361598260] [2022-11-20 09:30:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:48,295 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-20 09:30:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:50,596 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-20 09:30:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:50,597 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 508 [2022-11-20 09:30:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:50,619 INFO L225 Difference]: With dead ends: 19651 [2022-11-20 09:30:50,620 INFO L226 Difference]: Without dead ends: 11471 [2022-11-20 09:30:50,628 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-20 09:30:50,629 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:50,629 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.2s Time] [2022-11-20 09:30:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-20 09:30:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-20 09:30:50,763 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-20 09:30:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-20 09:30:50,778 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 508 [2022-11-20 09:30:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:50,779 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-20 09:30:50,780 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-20 09:30:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-20 09:30:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-11-20 09:30:50,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:50,796 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, 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, 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-20 09:30:50,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:30:50,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -732988878, now seen corresponding path program 1 times [2022-11-20 09:30:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:50,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635038568] [2022-11-20 09:30:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 519 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-20 09:30:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:51,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635038568] [2022-11-20 09:30:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635038568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:30:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351211514] [2022-11-20 09:30:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:51,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:30:51,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:30:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:51,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:30:52,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-20 09:30:52,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:52,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351211514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:52,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:30:52,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 09:30:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691621259] [2022-11-20 09:30:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:52,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:30:52,216 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:54,401 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-20 09:30:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:54,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 541 [2022-11-20 09:30:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:54,421 INFO L225 Difference]: With dead ends: 17246 [2022-11-20 09:30:54,422 INFO L226 Difference]: Without dead ends: 9969 [2022-11-20 09:30:54,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 540 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-20 09:30:54,429 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:54,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 09:30:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-20 09:30:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-20 09:30:54,561 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-20 09:30:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-20 09:30:54,576 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 541 [2022-11-20 09:30:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:54,577 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-20 09:30:54,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-20 09:30:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2022-11-20 09:30:54,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:54,584 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, 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, 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-20 09:30:54,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:54,801 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -93352388, now seen corresponding path program 1 times [2022-11-20 09:30:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355462775] [2022-11-20 09:30:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-20 09:30:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355462775] [2022-11-20 09:30:55,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355462775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:55,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:55,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243215698] [2022-11-20 09:30:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:55,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:55,658 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:58,290 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-20 09:30:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 545 [2022-11-20 09:30:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:58,318 INFO L225 Difference]: With dead ends: 24136 [2022-11-20 09:30:58,318 INFO L226 Difference]: Without dead ends: 14468 [2022-11-20 09:30:58,325 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-20 09:30:58,326 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:58,326 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.5s Time] [2022-11-20 09:30:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-20 09:30:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-20 09:30:58,501 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-20 09:30:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-20 09:30:58,526 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 545 [2022-11-20 09:30:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:58,527 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-20 09:30:58,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-20 09:30:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2022-11-20 09:30:58,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:58,538 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, 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, 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-20 09:30:58,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:30:58,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:58,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1966218800, now seen corresponding path program 1 times [2022-11-20 09:30:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:58,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252526527] [2022-11-20 09:30:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 676 proven. 39 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-11-20 09:30:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252526527] [2022-11-20 09:30:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252526527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:30:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303982792] [2022-11-20 09:30:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:59,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:30:59,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:30:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:59,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:30:59,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-20 09:31:00,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:00,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303982792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:00,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:31:00,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 09:31:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550521477] [2022-11-20 09:31:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:00,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:00,037 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:02,295 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-20 09:31:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 620 [2022-11-20 09:31:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:02,319 INFO L225 Difference]: With dead ends: 27712 [2022-11-20 09:31:02,319 INFO L226 Difference]: Without dead ends: 13855 [2022-11-20 09:31:02,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 619 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-20 09:31:02,330 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:02,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 09:31:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-20 09:31:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-20 09:31:02,501 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-20 09:31:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-20 09:31:02,522 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 620 [2022-11-20 09:31:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:02,524 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-20 09:31:02,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-20 09:31:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2022-11-20 09:31:02,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,538 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, 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, 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-20 09:31:02,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:02,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:02,745 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1575532913, now seen corresponding path program 1 times [2022-11-20 09:31:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710680244] [2022-11-20 09:31:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-20 09:31:03,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:03,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710680244] [2022-11-20 09:31:03,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710680244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:03,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059904495] [2022-11-20 09:31:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:03,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:03,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:03,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:31:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:04,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:31:04,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-20 09:31:05,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-20 09:31:06,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059904495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:06,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:06,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-20 09:31:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463685104] [2022-11-20 09:31:06,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:31:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:31:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:06,336 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-20 09:31:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:14,700 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-20 09:31:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:31:14,701 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 621 [2022-11-20 09:31:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:14,727 INFO L225 Difference]: With dead ends: 35741 [2022-11-20 09:31:14,728 INFO L226 Difference]: Without dead ends: 16247 [2022-11-20 09:31:14,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1236 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-20 09:31:14,738 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2855 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5909 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 5909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:14,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 246 Invalid, 6570 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [661 Valid, 5909 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-20 09:31:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-20 09:31:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-20 09:31:14,910 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-20 09:31:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-20 09:31:14,927 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 621 [2022-11-20 09:31:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:14,927 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-20 09:31:14,927 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-20 09:31:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-20 09:31:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2022-11-20 09:31:14,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:14,937 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 09:31:14,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:15,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 09:31:15,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1914023780, now seen corresponding path program 1 times [2022-11-20 09:31:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:15,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375327955] [2022-11-20 09:31:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-20 09:31:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:15,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375327955] [2022-11-20 09:31:15,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375327955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:15,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:15,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:15,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293167065] [2022-11-20 09:31:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:15,706 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:16,990 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-20 09:31:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 658 [2022-11-20 09:31:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:17,016 INFO L225 Difference]: With dead ends: 28295 [2022-11-20 09:31:17,016 INFO L226 Difference]: Without dead ends: 15940 [2022-11-20 09:31:17,024 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-20 09:31:17,024 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 257 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:17,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 09:31:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-20 09:31:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-20 09:31:17,212 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-20 09:31:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-20 09:31:17,319 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 658 [2022-11-20 09:31:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-20 09:31:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-20 09:31:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2022-11-20 09:31:17,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:17,339 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 09:31:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:31:17,340 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1275389892, now seen corresponding path program 1 times [2022-11-20 09:31:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:17,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004979438] [2022-11-20 09:31:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-11-20 09:31:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004979438] [2022-11-20 09:31:18,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004979438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:18,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:18,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:31:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792707711] [2022-11-20 09:31:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:31:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:31:18,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:18,071 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:20,166 INFO L93 Difference]: Finished difference Result 33973 states and 35169 transitions. [2022-11-20 09:31:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:31:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 682 [2022-11-20 09:31:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:20,179 INFO L225 Difference]: With dead ends: 33973 [2022-11-20 09:31:20,179 INFO L226 Difference]: Without dead ends: 18932 [2022-11-20 09:31:20,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:20,188 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 675 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:20,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 426 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-20 09:31:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2022-11-20 09:31:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18035. [2022-11-20 09:31:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18035 states, 18034 states have (on average 1.0311633581013642) internal successors, (18596), 18034 states have internal predecessors, (18596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 18596 transitions. [2022-11-20 09:31:20,426 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 18596 transitions. Word has length 682 [2022-11-20 09:31:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:20,427 INFO L495 AbstractCegarLoop]: Abstraction has 18035 states and 18596 transitions. [2022-11-20 09:31:20,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 18596 transitions. [2022-11-20 09:31:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2022-11-20 09:31:20,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:20,441 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:31:20,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:31:20,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:20,443 INFO L85 PathProgramCache]: Analyzing trace with hash -402468340, now seen corresponding path program 1 times [2022-11-20 09:31:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:20,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139704792] [2022-11-20 09:31:20,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-11-20 09:31:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:20,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139704792] [2022-11-20 09:31:20,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139704792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:20,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:20,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803847371] [2022-11-20 09:31:20,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:20,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:20,917 INFO L87 Difference]: Start difference. First operand 18035 states and 18596 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-20 09:31:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:22,131 INFO L93 Difference]: Finished difference Result 36065 states and 37196 transitions. [2022-11-20 09:31:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:22,133 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 713 [2022-11-20 09:31:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:22,226 INFO L225 Difference]: With dead ends: 36065 [2022-11-20 09:31:22,226 INFO L226 Difference]: Without dead ends: 18331 [2022-11-20 09:31:22,231 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-20 09:31:22,235 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:22,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 09:31:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2022-11-20 09:31:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18031. [2022-11-20 09:31:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 18030 states have (on average 1.031003882418192) internal successors, (18589), 18030 states have internal predecessors, (18589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 18589 transitions. [2022-11-20 09:31:22,458 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 18589 transitions. Word has length 713 [2022-11-20 09:31:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:22,459 INFO L495 AbstractCegarLoop]: Abstraction has 18031 states and 18589 transitions. [2022-11-20 09:31:22,459 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-20 09:31:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 18589 transitions. [2022-11-20 09:31:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2022-11-20 09:31:22,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:22,477 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, 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, 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-20 09:31:22,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:31:22,477 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1638431091, now seen corresponding path program 1 times [2022-11-20 09:31:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:22,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380348273] [2022-11-20 09:31:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-20 09:31:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:23,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380348273] [2022-11-20 09:31:23,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380348273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:23,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:23,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058545770] [2022-11-20 09:31:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:23,098 INFO L87 Difference]: Start difference. First operand 18031 states and 18589 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:24,473 INFO L93 Difference]: Finished difference Result 38449 states and 39675 transitions. [2022-11-20 09:31:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:24,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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 784 [2022-11-20 09:31:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:24,492 INFO L225 Difference]: With dead ends: 38449 [2022-11-20 09:31:24,492 INFO L226 Difference]: Without dead ends: 20719 [2022-11-20 09:31:24,502 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-20 09:31:24,502 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:24,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 161 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 09:31:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2022-11-20 09:31:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 19523. [2022-11-20 09:31:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19523 states, 19522 states have (on average 1.0284806884540518) internal successors, (20078), 19522 states have internal predecessors, (20078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19523 states to 19523 states and 20078 transitions. [2022-11-20 09:31:24,736 INFO L78 Accepts]: Start accepts. Automaton has 19523 states and 20078 transitions. Word has length 784 [2022-11-20 09:31:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:24,737 INFO L495 AbstractCegarLoop]: Abstraction has 19523 states and 20078 transitions. [2022-11-20 09:31:24,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19523 states and 20078 transitions. [2022-11-20 09:31:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2022-11-20 09:31:24,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:24,756 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:31:24,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:31:24,757 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -523331930, now seen corresponding path program 1 times [2022-11-20 09:31:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799392724] [2022-11-20 09:31:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-11-20 09:31:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:25,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799392724] [2022-11-20 09:31:25,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799392724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:25,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:25,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090007468] [2022-11-20 09:31:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:25,256 INFO L87 Difference]: Start difference. First operand 19523 states and 20078 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:26,634 INFO L93 Difference]: Finished difference Result 41433 states and 42655 transitions. [2022-11-20 09:31:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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 805 [2022-11-20 09:31:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:26,656 INFO L225 Difference]: With dead ends: 41433 [2022-11-20 09:31:26,656 INFO L226 Difference]: Without dead ends: 21912 [2022-11-20 09:31:26,666 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-20 09:31:26,668 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:26,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 460 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 09:31:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2022-11-20 09:31:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 17124. [2022-11-20 09:31:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17124 states, 17123 states have (on average 1.0263972434736903) internal successors, (17575), 17123 states have internal predecessors, (17575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 17575 transitions. [2022-11-20 09:31:26,911 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 17575 transitions. Word has length 805 [2022-11-20 09:31:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:26,912 INFO L495 AbstractCegarLoop]: Abstraction has 17124 states and 17575 transitions. [2022-11-20 09:31:26,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 17575 transitions. [2022-11-20 09:31:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-20 09:31:26,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:26,931 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 09:31:26,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:31:26,932 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1479206236, now seen corresponding path program 1 times [2022-11-20 09:31:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079129539] [2022-11-20 09:31:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-11-20 09:31:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:27,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079129539] [2022-11-20 09:31:27,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079129539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:27,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:27,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12302789] [2022-11-20 09:31:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:27,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:27,441 INFO L87 Difference]: Start difference. First operand 17124 states and 17575 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-20 09:31:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:28,713 INFO L93 Difference]: Finished difference Result 36039 states and 37016 transitions. [2022-11-20 09:31:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:28,714 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 842 [2022-11-20 09:31:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:28,728 INFO L225 Difference]: With dead ends: 36039 [2022-11-20 09:31:28,729 INFO L226 Difference]: Without dead ends: 19216 [2022-11-20 09:31:28,736 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-20 09:31:28,736 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 310 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:28,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 09:31:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2022-11-20 09:31:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 18020. [2022-11-20 09:31:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18020 states, 18019 states have (on average 1.0254176147399967) internal successors, (18477), 18019 states have internal predecessors, (18477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 18477 transitions. [2022-11-20 09:31:28,920 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 18477 transitions. Word has length 842 [2022-11-20 09:31:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:28,920 INFO L495 AbstractCegarLoop]: Abstraction has 18020 states and 18477 transitions. [2022-11-20 09:31:28,921 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-20 09:31:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 18477 transitions. [2022-11-20 09:31:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-11-20 09:31:28,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:28,932 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 09:31:28,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:31:28,932 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash -537887034, now seen corresponding path program 1 times [2022-11-20 09:31:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:28,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111395159] [2022-11-20 09:31:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 629 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-20 09:31:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111395159] [2022-11-20 09:31:30,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111395159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962517029] [2022-11-20 09:31:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:30,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:30,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:31:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:31,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:31:31,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-20 09:31:31,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962517029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:31,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:31:31,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-20 09:31:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779072584] [2022-11-20 09:31:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:31,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:31,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:31,432 INFO L87 Difference]: Start difference. First operand 18020 states and 18477 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:32,968 INFO L93 Difference]: Finished difference Result 39939 states and 40943 transitions. [2022-11-20 09:31:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:32,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 863 [2022-11-20 09:31:32,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:32,986 INFO L225 Difference]: With dead ends: 39939 [2022-11-20 09:31:32,986 INFO L226 Difference]: Without dead ends: 21921 [2022-11-20 09:31:32,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 862 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-20 09:31:32,996 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 271 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:32,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 493 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 09:31:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2022-11-20 09:31:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 19818. [2022-11-20 09:31:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19818 states, 19817 states have (on average 1.025129938941313) internal successors, (20315), 19817 states have internal predecessors, (20315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20315 transitions. [2022-11-20 09:31:33,200 INFO L78 Accepts]: Start accepts. Automaton has 19818 states and 20315 transitions. Word has length 863 [2022-11-20 09:31:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:33,200 INFO L495 AbstractCegarLoop]: Abstraction has 19818 states and 20315 transitions. [2022-11-20 09:31:33,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19818 states and 20315 transitions. [2022-11-20 09:31:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-11-20 09:31:33,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:33,211 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 09:31:33,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:33,417 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash 943867835, now seen corresponding path program 1 times [2022-11-20 09:31:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:33,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432089513] [2022-11-20 09:31:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 703 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-20 09:31:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:35,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432089513] [2022-11-20 09:31:35,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432089513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312156623] [2022-11-20 09:31:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:35,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:35,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:35,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:35,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb16349f-f264-4352-8260-0daad168369b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:31:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:35,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:31:35,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:00,295 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 13 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:38:56,587 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 ((.cse8 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse8 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse8 50) 29)) (= (mod .cse8 10) 0)))) (exists ((v_~a29~0_899 Int)) (let ((.cse11 (* 9 v_~a29~0_899))) (let ((.cse9 (div .cse11 10))) (let ((.cse10 (div (+ .cse9 1) 5))) (and (= (mod .cse9 5) 0) (= (mod .cse10 29) 0) (<= (mod (div .cse11 50) 29) .cse2) (= (mod .cse11 10) 0) (<= 0 (+ .cse10 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse14 (* 9 v_~a29~0_899))) (let ((.cse12 (div .cse14 10))) (let ((.cse13 (div (+ .cse12 1) 5))) (and (= (mod .cse12 5) 0) (= (mod .cse13 29) 0) (<= (mod (div .cse14 50) 29) .cse2) (<= 0 (+ .cse13 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse17 (* 9 v_~a29~0_899))) (let ((.cse18 (div .cse17 50))) (let ((.cse15 (mod .cse18 29)) (.cse16 (div .cse17 10))) (and (not (= 0 .cse15)) (= (mod .cse16 5) 0) (<= .cse15 .cse6) (= (mod .cse17 10) 0) (not (= (mod (+ (div (+ .cse16 1) 5) 1) 29) 0)) (< (+ .cse18 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse20 (* 9 v_~a29~0_899))) (let ((.cse19 (+ (div .cse20 10) 1))) (and (<= (mod (div .cse19 5) 29) .cse2) (< .cse20 0) (= (mod .cse19 5) 0) (not (< (+ (div .cse20 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse21 50))) (let ((.cse22 (mod .cse23 29))) (and (= (mod (div (+ (div .cse21 10) 1) 5) 29) 0) (<= .cse22 .cse2) (= 0 .cse22) (= (mod .cse21 10) 0) (not (< (+ .cse23 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (div (* 9 v_~a29~0_899) 50))) (let ((.cse24 (mod .cse25 29))) (and (<= .cse24 .cse2) (= 0 .cse24) (not (< (+ .cse25 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse28 50)) (.cse27 (div (+ (div .cse28 10) 1) 5))) (and (= (mod (+ .cse26 1) 29) 0) (<= (mod .cse26 29) .cse2) (= (mod (+ .cse27 1) 29) 0) (= (mod .cse28 10) 0) (not (< .cse27 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50)) (.cse30 (div (+ (div .cse31 10) 1) 5))) (and (= (mod (+ .cse29 1) 29) 0) (<= (mod .cse29 29) .cse2) (= (mod (+ .cse30 1) 29) 0) (not (< .cse30 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse32 (div (+ (div .cse33 10) 1) 5))) (and (= (mod .cse32 29) 0) (<= (mod (div .cse33 50) 29) .cse2) (= (mod .cse33 10) 0) (<= 0 (+ .cse32 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse35 50))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (not (< (div .cse35 10) 0)) (= (mod .cse35 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 50)) (.cse36 (div .cse38 10))) (and (= (mod (div (+ .cse36 1) 5) 29) 0) (= (mod (+ .cse37 1) 29) 0) (<= (mod .cse37 29) .cse2) (not (< .cse36 0)) (= (mod .cse38 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse39 50))) (let ((.cse40 (mod .cse41 29))) (and (= (mod (div (+ (div .cse39 10) 1) 5) 29) 0) (<= .cse40 .cse2) (= 0 .cse40) (not (< (+ .cse41 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse44 (div .cse42 5))) (let ((.cse43 (+ .cse44 1))) (and (not (= (mod .cse42 5) 0)) (not (< .cse43 0)) (< .cse44 0) (<= (mod .cse43 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse46 (mod (+ (div (+ (div .cse45 10) 1) 5) 1) 29))) (and (not (= (mod .cse45 10) 0)) (= .cse46 0) (= 0 (mod (div .cse45 50) 29)) (<= .cse46 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (* 9 v_~a29~0_899))) (let ((.cse48 (+ (div .cse47 10) 1))) (let ((.cse49 (div .cse48 5)) (.cse50 (div .cse47 50))) (and (not (= (mod .cse47 10) 0)) (not (= (mod .cse48 5) 0)) (not (= (mod .cse49 29) 0)) (= 0 (mod .cse50 29)) (not (= (mod (+ .cse49 1) 29) 0)) (< (+ .cse50 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse51 (div .cse53 10))) (let ((.cse52 (div (+ .cse51 1) 5))) (and (= (mod .cse51 5) 0) (= (mod (+ .cse52 1) 29) 0) (<= (mod (div .cse53 50) 29) .cse6) (= (mod .cse53 10) 0) (< .cse52 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse54 (div (+ (div .cse55 10) 1) 5)) (.cse56 (div .cse55 50))) (and (= (mod .cse54 29) 0) (not (= (mod .cse55 10) 0)) (<= (mod (+ .cse54 1) 29) .cse6) (= 0 (mod .cse56 29)) (< (+ .cse56 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse57 (div .cse59 50))) (let ((.cse60 (+ .cse57 1))) (let ((.cse58 (mod .cse60 29))) (and (not (= 0 (mod .cse57 29))) (not (= .cse58 0)) (= (mod (+ (div (+ (div .cse59 10) 1) 5) 1) 29) 0) (<= .cse58 .cse6) (= (mod .cse59 10) 0) (< .cse60 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse61 50))) (and (= (mod (div .cse61 10) 5) 0) (<= (mod .cse62 29) .cse2) (<= 0 .cse62) (= (mod .cse61 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (div .cse63 50))) (and (= (mod (div .cse63 10) 5) 0) (= (mod (+ .cse64 1) 29) 0) (<= (mod .cse64 29) .cse2) (not (< .cse64 0)))))) (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))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse68 (+ (div .cse67 10) 1))) (let ((.cse70 (div .cse68 5))) (let ((.cse69 (mod (+ .cse70 1) 29))) (and (= (mod (+ (div .cse67 50) 1) 29) 0) (not (= (mod .cse67 10) 0)) (not (= (mod .cse68 5) 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 29) .cse2) (= (mod (+ (div (+ (div .cse72 10) 1) 5) 1) 29) 0) (<= 0 .cse71) (= (mod .cse72 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (= (mod (+ .cse73 1) 29) 0) (<= (mod .cse73 29) .cse2) (not (< (div .cse74 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse77 10)) (.cse76 (div .cse77 50))) (and (= (mod .cse75 5) 0) (<= (mod .cse76 29) .cse2) (= (mod (+ (div (+ .cse75 1) 5) 1) 29) 0) (<= 0 .cse76))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse80 50)) (.cse81 (+ (div .cse80 10) 1))) (let ((.cse82 (div .cse81 5)) (.cse79 (+ .cse78 1))) (and (not (= 0 (mod .cse78 29))) (not (= (mod .cse79 29) 0)) (not (= (mod .cse80 10) 0)) (not (= (mod .cse81 5) 0)) (not (= (mod .cse82 29) 0)) (<= (mod (+ .cse82 1) 29) .cse6) (< .cse79 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse83 50))) (and (= (mod (div (+ (div .cse83 10) 1) 5) 29) 0) (<= (mod .cse84 29) .cse2) (<= 0 .cse84))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse87 (div .cse85 50))) (let ((.cse86 (mod .cse87 29))) (and (= (mod (div .cse85 10) 5) 0) (<= .cse86 .cse2) (= 0 .cse86) (not (< (+ .cse87 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse88 (div (+ (div .cse89 10) 1) 5))) (and (<= 0 .cse88) (<= (mod .cse88 29) .cse2) (< .cse89 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse90 (mod (div (+ (div .cse91 10) 1) 5) 29))) (and (= .cse90 0) (<= .cse90 .cse2) (< .cse91 0) (not (< (+ (div .cse91 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse92 29) .cse2) (<= 0 .cse92)))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse93 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse93 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse95 (div .cse97 10))) (let ((.cse96 (div (+ .cse95 1) 5)) (.cse94 (mod (+ (div .cse97 50) 1) 29))) (and (= .cse94 0) (not (= (mod .cse95 5) 0)) (= (mod (+ .cse96 1) 29) 0) (= (mod .cse97 10) 0) (< .cse96 0) (<= .cse94 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse100 (div .cse98 50))) (let ((.cse99 (mod .cse100 29))) (and (= (mod (div .cse98 10) 5) 0) (<= .cse99 .cse2) (= 0 .cse99) (= (mod .cse98 10) 0) (< (+ .cse100 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse105 50))) (let ((.cse103 (div .cse105 10)) (.cse106 (+ .cse101 1))) (let ((.cse102 (mod .cse106 29)) (.cse104 (div (+ .cse103 1) 5))) (and (not (= 0 (mod .cse101 29))) (not (= .cse102 0)) (not (= (mod .cse103 5) 0)) (not (= (mod .cse104 29) 0)) (<= .cse102 .cse6) (= (mod .cse105 10) 0) (not (= (mod (+ .cse104 1) 29) 0)) (< .cse106 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse110 (+ (div .cse107 10) 1))) (let ((.cse108 (mod (div .cse110 5) 29)) (.cse109 (div .cse107 50))) (and (not (= (mod .cse107 10) 0)) (not (= .cse108 0)) (<= .cse108 .cse6) (= 0 (mod .cse109 29)) (= (mod .cse110 5) 0) (< (+ .cse109 1) 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 ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse119 (div .cse118 50))) (let ((.cse120 (+ .cse119 1))) (and (not (= (mod (div (+ (div .cse118 10) 1) 5) 29) 0)) (= 0 (mod .cse119 29)) (<= (mod .cse120 29) .cse6) (= (mod .cse118 10) 0) (< .cse120 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse122 (div .cse121 50))) (and (= (mod (div .cse121 10) 5) 0) (= (mod (+ .cse122 1) 29) 0) (<= (mod .cse122 29) .cse2) (not (< .cse122 0)) (= (mod .cse121 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div (+ (div .cse125 10) 1) 5))) (let ((.cse123 (mod .cse124 29))) (and (= .cse123 0) (not (< (+ .cse124 1) 0)) (<= .cse123 .cse2) (< .cse125 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div (+ (div .cse127 10) 1) 5))) (and (< .cse126 0) (<= (mod (+ .cse126 1) 29) .cse2) (not (< (+ (div .cse127 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div (+ (div .cse129 10) 1) 5))) (and (not (< (+ .cse128 1) 0)) (<= (mod .cse128 29) .cse6) (< (+ (div .cse129 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse132 50)) (.cse130 (div .cse132 10))) (and (= (mod (div (+ .cse130 1) 5) 29) 0) (= (mod (+ .cse131 1) 29) 0) (<= (mod .cse131 29) .cse2) (not (< .cse130 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse134 (div (+ (div .cse135 10) 1) 5)) (.cse133 (mod (+ (div .cse135 50) 1) 29))) (and (= .cse133 0) (not (= (mod .cse134 29) 0)) (= (mod .cse135 10) 0) (not (= (mod (+ .cse134 1) 29) 0)) (<= .cse133 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 10))) (let ((.cse138 (div (+ .cse136 1) 5))) (and (= (mod .cse136 5) 0) (<= (mod (div .cse137 50) 29) .cse2) (= (mod (+ .cse138 1) 29) 0) (= (mod .cse137 10) 0) (not (< .cse138 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (div .cse141 50)) (.cse139 (div .cse141 10))) (and (= (mod .cse139 5) 0) (= (mod (+ .cse140 1) 29) 0) (<= (mod .cse140 29) .cse2) (not (< (div (+ .cse139 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse144 10)) (.cse143 (div .cse144 50))) (and (= (mod .cse142 5) 0) (<= (mod .cse143 29) .cse2) (= (mod (+ (div (+ .cse142 1) 5) 1) 29) 0) (<= 0 .cse143) (= (mod .cse144 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse150 (+ (div .cse147 10) 1))) (let ((.cse145 (div .cse147 50)) (.cse149 (div .cse150 5))) (let ((.cse148 (mod .cse149 29)) (.cse146 (+ .cse145 1))) (and (not (= 0 (mod .cse145 29))) (not (= (mod .cse146 29) 0)) (not (= (mod .cse147 10) 0)) (not (= .cse148 0)) (<= .cse148 .cse6) (not (= (mod (+ .cse149 1) 29) 0)) (= (mod .cse150 5) 0) (< .cse146 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse151 (+ (div .cse152 10) 1))) (and (not (< .cse151 0)) (<= (mod (div .cse151 5) 29) .cse2) (< .cse152 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse155 (div .cse154 10)) (.cse153 (mod (+ (div .cse154 50) 1) 29))) (and (= .cse153 0) (= (mod .cse154 10) 0) (not (= (mod (+ (div (+ .cse155 1) 5) 1) 29) 0)) (< .cse155 0) (<= .cse153 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse156 (* 9 v_~a29~0_899))) (let ((.cse158 (div .cse156 50))) (let ((.cse157 (mod .cse158 29))) (and (= (mod (div .cse156 10) 5) 0) (<= .cse157 .cse2) (= 0 .cse157) (= (mod .cse156 10) 0) (not (< (+ .cse158 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse160 (* 9 v_~a29~0_899))) (let ((.cse159 (div .cse160 50))) (and (<= (mod .cse159 29) .cse2) (<= 0 .cse159) (= (mod .cse160 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse162 (* 9 v_~a29~0_899))) (let ((.cse163 (div (+ (div .cse162 10) 1) 5))) (let ((.cse161 (mod .cse163 29))) (and (= .cse161 0) (= (mod (+ (div .cse162 50) 1) 29) 0) (not (= (mod .cse162 10) 0)) (< (+ .cse163 1) 0) (<= .cse161 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse164 (* 9 v_~a29~0_899))) (let ((.cse165 (div .cse164 50))) (and (= (mod (div .cse164 10) 5) 0) (<= (mod .cse165 29) .cse2) (<= 0 .cse165))))))) is different from true [2022-11-20 09:39:59,831 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 ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse19 50))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 .cse17)) (= (mod .cse18 5) 0) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< (+ .cse20 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse21 (+ (div .cse22 10) 1))) (and (<= (mod (div .cse21 5) 29) .cse2) (< .cse22 0) (= (mod .cse21 5) 0) (not (< (+ (div .cse22 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse23 50))) (let ((.cse24 (mod .cse25 29))) (and (= (mod (div (+ (div .cse23 10) 1) 5) 29) 0) (<= .cse24 .cse2) (= 0 .cse24) (= (mod .cse23 10) 0) (not (< (+ .cse25 1) 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 ((.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 ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse53 50))) (and (= (mod (div .cse53 10) 5) 0) (<= (mod .cse54 29) .cse2) (<= 0 .cse54) (= (mod .cse53 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse55 50))) (and (= (mod (div .cse55 10) 5) 0) (= (mod (+ .cse56 1) 29) 0) (<= (mod .cse56 29) .cse2) (not (< .cse56 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse58 (+ (div .cse57 10) 1)) (.cse59 (div .cse57 50))) (and (not (= (mod .cse57 10) 0)) (<= (mod (div .cse58 5) 29) .cse6) (= 0 (mod .cse59 29)) (= (mod .cse58 5) 0) (< (+ .cse59 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (+ (div .cse60 10) 1))) (let ((.cse62 (div .cse61 5))) (and (not (= (mod .cse60 10) 0)) (not (= (mod .cse61 5) 0)) (not (= (mod .cse62 29) 0)) (= 0 (mod (div .cse60 50) 29)) (not (= (mod (+ .cse62 1) 29) 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 ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse82 50)) (.cse83 (+ (div .cse82 10) 1))) (let ((.cse84 (div .cse83 5)) (.cse81 (+ .cse80 1))) (and (not (= 0 (mod .cse80 29))) (not (= (mod .cse81 29) 0)) (not (= (mod .cse82 10) 0)) (not (= (mod .cse83 5) 0)) (not (= (mod .cse84 29) 0)) (<= (mod (+ .cse84 1) 29) .cse6) (< .cse81 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse85 50))) (and (= (mod (div (+ (div .cse85 10) 1) 5) 29) 0) (<= (mod .cse86 29) .cse2) (<= 0 .cse86))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse87 50))) (let ((.cse88 (mod .cse89 29))) (and (= (mod (div .cse87 10) 5) 0) (<= .cse88 .cse2) (= 0 .cse88) (not (< (+ .cse89 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse90 (div (+ (div .cse91 10) 1) 5))) (and (<= 0 .cse90) (<= (mod .cse90 29) .cse2) (< .cse91 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse92 (mod (div (+ (div .cse93 10) 1) 5) 29))) (and (= .cse92 0) (<= .cse92 .cse2) (< .cse93 0) (not (< (+ (div .cse93 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse94 29) .cse2) (<= 0 .cse94)))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse98 10))) (let ((.cse97 (div (+ .cse96 1) 5)) (.cse95 (mod (+ (div .cse98 50) 1) 29))) (and (= .cse95 0) (not (= (mod .cse96 5) 0)) (= (mod (+ .cse97 1) 29) 0) (= (mod .cse98 10) 0) (< .cse97 0) (<= .cse95 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse99 50))) (let ((.cse100 (mod .cse101 29))) (and (= (mod (div .cse99 10) 5) 0) (<= .cse100 .cse2) (= 0 .cse100) (= (mod .cse99 10) 0) (< (+ .cse101 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse106 50))) (let ((.cse104 (div .cse106 10)) (.cse107 (+ .cse102 1))) (let ((.cse103 (mod .cse107 29)) (.cse105 (div (+ .cse104 1) 5))) (and (not (= 0 (mod .cse102 29))) (not (= .cse103 0)) (not (= (mod .cse104 5) 0)) (not (= (mod .cse105 29) 0)) (<= .cse103 .cse6) (= (mod .cse106 10) 0) (not (= (mod (+ .cse105 1) 29) 0)) (< .cse107 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse111 50))) (let ((.cse108 (div .cse111 10)) (.cse110 (+ .cse109 1))) (and (= (mod (div (+ .cse108 1) 5) 29) 0) (not (= (mod .cse108 5) 0)) (= 0 (mod .cse109 29)) (<= (mod .cse110 29) .cse6) (= (mod .cse111 10) 0) (< .cse110 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse113 50))) (let ((.cse112 (mod .cse114 29))) (and (<= .cse112 .cse2) (= 0 .cse112) (= (mod .cse113 10) 0) (not (< (+ .cse114 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (let ((.cse117 (+ .cse116 1))) (and (not (= (mod (div (+ (div .cse115 10) 1) 5) 29) 0)) (= 0 (mod .cse116 29)) (<= (mod .cse117 29) .cse6) (= (mod .cse115 10) 0) (< .cse117 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse119 (div .cse118 50))) (and (= (mod (div .cse118 10) 5) 0) (= (mod (+ .cse119 1) 29) 0) (<= (mod .cse119 29) .cse2) (not (< .cse119 0)) (= (mod .cse118 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5))) (let ((.cse120 (mod .cse121 29))) (and (= .cse120 0) (not (< (+ .cse121 1) 0)) (<= .cse120 .cse2) (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (and (< .cse123 0) (<= (mod (+ .cse123 1) 29) .cse2) (not (< (+ (div .cse124 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (not (< (+ .cse125 1) 0)) (<= (mod .cse125 29) .cse6) (< (+ (div .cse126 50) 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 ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse130 (div .cse131 10))) (let ((.cse132 (div (+ .cse130 1) 5))) (and (= (mod .cse130 5) 0) (<= (mod (div .cse131 50) 29) .cse2) (= (mod (+ .cse132 1) 29) 0) (= (mod .cse131 10) 0) (not (< .cse132 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse134 (div .cse135 50)) (.cse133 (div .cse135 10))) (and (= (mod .cse133 5) 0) (= (mod (+ .cse134 1) 29) 0) (<= (mod .cse134 29) .cse2) (not (< (div (+ .cse133 1) 5) 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 ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse151 (div (+ (div .cse150 10) 1) 5))) (let ((.cse149 (mod .cse151 29))) (and (= .cse149 0) (= (mod (+ (div .cse150 50) 1) 29) 0) (not (= (mod .cse150 10) 0)) (< (+ .cse151 1) 0) (<= .cse149 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse153 (div .cse152 50))) (and (= (mod (div .cse152 10) 5) 0) (<= (mod .cse153 29) .cse2) (<= 0 .cse153))))))) is different from true [2022-11-20 09:40:44,174 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 ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse19 50))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 .cse17)) (= (mod .cse18 5) 0) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< (+ .cse20 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse21 (+ (div .cse22 10) 1))) (and (<= (mod (div .cse21 5) 29) .cse2) (< .cse22 0) (= (mod .cse21 5) 0) (not (< (+ (div .cse22 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse23 50))) (let ((.cse24 (mod .cse25 29))) (and (= (mod (div (+ (div .cse23 10) 1) 5) 29) 0) (<= .cse24 .cse2) (= 0 .cse24) (= (mod .cse23 10) 0) (not (< (+ .cse25 1) 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 ((.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 ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse53 50))) (and (= (mod (div .cse53 10) 5) 0) (<= (mod .cse54 29) .cse2) (<= 0 .cse54) (= (mod .cse53 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse55 50))) (and (= (mod (div .cse55 10) 5) 0) (= (mod (+ .cse56 1) 29) 0) (<= (mod .cse56 29) .cse2) (not (< .cse56 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse58 (+ (div .cse57 10) 1)) (.cse59 (div .cse57 50))) (and (not (= (mod .cse57 10) 0)) (<= (mod (div .cse58 5) 29) .cse6) (= 0 (mod .cse59 29)) (= (mod .cse58 5) 0) (< (+ .cse59 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (+ (div .cse60 10) 1))) (let ((.cse62 (div .cse61 5))) (and (not (= (mod .cse60 10) 0)) (not (= (mod .cse61 5) 0)) (not (= (mod .cse62 29) 0)) (= 0 (mod (div .cse60 50) 29)) (not (= (mod (+ .cse62 1) 29) 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))) (let ((.cse112 (+ .cse111 1))) (and (not (= (mod (div (+ (div .cse110 10) 1) 5) 29) 0)) (= 0 (mod .cse111 29)) (<= (mod .cse112 29) .cse6) (= (mod .cse110 10) 0) (< .cse112 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse113 50))) (and (= (mod (div .cse113 10) 5) 0) (= (mod (+ .cse114 1) 29) 0) (<= (mod .cse114 29) .cse2) (not (< .cse114 0)) (= (mod .cse113 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse116 (div (+ (div .cse117 10) 1) 5))) (let ((.cse115 (mod .cse116 29))) (and (= .cse115 0) (not (< (+ .cse116 1) 0)) (<= .cse115 .cse2) (< .cse117 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (and (< .cse118 0) (<= (mod (+ .cse118 1) 29) .cse2) (not (< (+ (div .cse119 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div (+ (div .cse121 10) 1) 5))) (and (not (< (+ .cse120 1) 0)) (<= (mod .cse120 29) .cse6) (< (+ (div .cse121 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse124 (+ (div .cse123 10) 1))) (let ((.cse125 (div .cse124 5)) (.cse122 (+ (div .cse123 50) 1))) (and (not (= (mod .cse122 29) 0)) (not (= (mod .cse123 10) 0)) (not (= (mod .cse124 5) 0)) (not (= (mod .cse125 29) 0)) (<= (mod (+ .cse125 1) 29) .cse6) (< .cse122 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div .cse128 50)) (.cse126 (div .cse128 10))) (and (= (mod (div (+ .cse126 1) 5) 29) 0) (= (mod (+ .cse127 1) 29) 0) (<= (mod .cse127 29) .cse2) (not (< .cse126 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse130 10))) (let ((.cse131 (div (+ .cse129 1) 5))) (and (= (mod .cse129 5) 0) (<= (mod (div .cse130 50) 29) .cse2) (= (mod (+ .cse131 1) 29) 0) (= (mod .cse130 10) 0) (not (< .cse131 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse134 50)) (.cse132 (div .cse134 10))) (and (= (mod .cse132 5) 0) (= (mod (+ .cse133 1) 29) 0) (<= (mod .cse133 29) .cse2) (not (< (div (+ .cse132 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse137 10)) (.cse136 (div .cse137 50))) (and (= (mod .cse135 5) 0) (<= (mod .cse136 29) .cse2) (= (mod (+ (div (+ .cse135 1) 5) 1) 29) 0) (<= 0 .cse136) (= (mod .cse137 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse138 (+ (div .cse139 10) 1))) (and (not (< .cse138 0)) (<= (mod (div .cse138 5) 29) .cse2) (< .cse139 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse141 10)) (.cse140 (mod (+ (div .cse141 50) 1) 29))) (and (= .cse140 0) (= (mod .cse141 10) 0) (not (= (mod (+ (div (+ .cse142 1) 5) 1) 29) 0)) (< .cse142 0) (<= .cse140 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse143 50))) (let ((.cse144 (mod .cse145 29))) (and (= (mod (div .cse143 10) 5) 0) (<= .cse144 .cse2) (= 0 .cse144) (= (mod .cse143 10) 0) (not (< (+ .cse145 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse147 50))) (and (<= (mod .cse146 29) .cse2) (<= 0 .cse146) (= (mod .cse147 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse150 (div (+ (div .cse149 10) 1) 5))) (let ((.cse148 (mod .cse150 29))) (and (= .cse148 0) (= (mod (+ (div .cse149 50) 1) 29) 0) (not (= (mod .cse149 10) 0)) (< (+ .cse150 1) 0) (<= .cse148 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse152 (div .cse151 50))) (and (= (mod (div .cse151 10) 5) 0) (<= (mod .cse152 29) .cse2) (<= 0 .cse152))))))) is different from true [2022-11-20 09:41:21,450 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 ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse19 50))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 .cse17)) (= (mod .cse18 5) 0) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< (+ .cse20 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (* 9 v_~a29~0_899))) (let ((.cse21 (+ (div .cse22 10) 1))) (and (<= (mod (div .cse21 5) 29) .cse2) (< .cse22 0) (= (mod .cse21 5) 0) (not (< (+ (div .cse22 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse23 50))) (let ((.cse24 (mod .cse25 29))) (and (= (mod (div (+ (div .cse23 10) 1) 5) 29) 0) (<= .cse24 .cse2) (= 0 .cse24) (= (mod .cse23 10) 0) (not (< (+ .cse25 1) 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 ((.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 ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse54 (div .cse53 50))) (and (= (mod (div .cse53 10) 5) 0) (<= (mod .cse54 29) .cse2) (<= 0 .cse54) (= (mod .cse53 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse55 50))) (and (= (mod (div .cse55 10) 5) 0) (= (mod (+ .cse56 1) 29) 0) (<= (mod .cse56 29) .cse2) (not (< .cse56 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse58 (+ (div .cse57 10) 1)) (.cse59 (div .cse57 50))) (and (not (= (mod .cse57 10) 0)) (<= (mod (div .cse58 5) 29) .cse6) (= 0 (mod .cse59 29)) (= (mod .cse58 5) 0) (< (+ .cse59 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse61 50))) (and (<= (mod .cse60 29) .cse2) (= (mod (+ (div (+ (div .cse61 10) 1) 5) 1) 29) 0) (<= 0 .cse60))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse63 50))) (and (<= (mod .cse62 29) .cse2) (= (mod (+ (div (+ (div .cse63 10) 1) 5) 1) 29) 0) (<= 0 .cse62) (= (mod .cse63 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse66 (div (+ (div .cse64 10) 1) 5))) (let ((.cse65 (mod (+ .cse66 1) 29))) (and (= (mod (+ (div .cse64 50) 1) 29) 0) (not (= (mod .cse64 10) 0)) (= .cse65 0) (< .cse66 0) (<= .cse65 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse68 50))) (and (= (mod (+ .cse67 1) 29) 0) (<= (mod .cse67 29) .cse2) (not (< (div .cse68 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse71 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse71 10)) (.cse70 (div .cse71 50))) (and (= (mod .cse69 5) 0) (<= (mod .cse70 29) .cse2) (= (mod (+ (div (+ .cse69 1) 5) 1) 29) 0) (<= 0 .cse70))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse76 (+ (div .cse73 10) 1))) (let ((.cse75 (div .cse76 5))) (let ((.cse74 (mod .cse75 29)) (.cse72 (div .cse73 50))) (and (not (= 0 (mod .cse72 29))) (not (= (mod .cse73 10) 0)) (not (= .cse74 0)) (<= .cse74 .cse6) (not (= (mod (+ .cse75 1) 29) 0)) (= (mod .cse76 5) 0) (< (+ .cse72 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse77 50))) (and (= (mod (div (+ (div .cse77 10) 1) 5) 29) 0) (<= (mod .cse78 29) .cse2) (<= 0 .cse78))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse81 (div .cse79 50))) (let ((.cse80 (mod .cse81 29))) (and (= (mod (div .cse79 10) 5) 0) (<= .cse80 .cse2) (= 0 .cse80) (not (< (+ .cse81 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse82 (div (+ (div .cse83 10) 1) 5))) (and (<= 0 .cse82) (<= (mod .cse82 29) .cse2) (< .cse83 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse84 (mod (div (+ (div .cse85 10) 1) 5) 29))) (and (= .cse84 0) (<= .cse84 .cse2) (< .cse85 0) (not (< (+ (div .cse85 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse86 29) .cse2) (<= 0 .cse86)))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10))) (let ((.cse89 (div (+ .cse88 1) 5)) (.cse87 (mod (+ (div .cse90 50) 1) 29))) (and (= .cse87 0) (not (= (mod .cse88 5) 0)) (= (mod (+ .cse89 1) 29) 0) (= (mod .cse90 10) 0) (< .cse89 0) (<= .cse87 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse91 50))) (let ((.cse92 (mod .cse93 29))) (and (= (mod (div .cse91 10) 5) 0) (<= .cse92 .cse2) (= 0 .cse92) (= (mod .cse91 10) 0) (< (+ .cse93 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse94 (div .cse98 50))) (let ((.cse96 (div .cse98 10)) (.cse99 (+ .cse94 1))) (let ((.cse95 (mod .cse99 29)) (.cse97 (div (+ .cse96 1) 5))) (and (not (= 0 (mod .cse94 29))) (not (= .cse95 0)) (not (= (mod .cse96 5) 0)) (not (= (mod .cse97 29) 0)) (<= .cse95 .cse6) (= (mod .cse98 10) 0) (not (= (mod (+ .cse97 1) 29) 0)) (< .cse99 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse103 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse103 50))) (let ((.cse100 (div .cse103 10)) (.cse102 (+ .cse101 1))) (and (= (mod (div (+ .cse100 1) 5) 29) 0) (not (= (mod .cse100 5) 0)) (= 0 (mod .cse101 29)) (<= (mod .cse102 29) .cse6) (= (mod .cse103 10) 0) (< .cse102 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse106 (div .cse105 50))) (let ((.cse104 (mod .cse106 29))) (and (<= .cse104 .cse2) (= 0 .cse104) (= (mod .cse105 10) 0) (not (< (+ .cse106 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse107 50))) (let ((.cse109 (+ .cse108 1))) (and (not (= (mod (div (+ (div .cse107 10) 1) 5) 29) 0)) (= 0 (mod .cse108 29)) (<= (mod .cse109 29) .cse6) (= (mod .cse107 10) 0) (< .cse109 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 ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse121 (+ (div .cse120 10) 1))) (let ((.cse122 (div .cse121 5)) (.cse119 (+ (div .cse120 50) 1))) (and (not (= (mod .cse119 29) 0)) (not (= (mod .cse120 10) 0)) (not (= (mod .cse121 5) 0)) (not (= (mod .cse122 29) 0)) (<= (mod (+ .cse122 1) 29) .cse6) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div .cse125 50)) (.cse123 (div .cse125 10))) (and (= (mod (div (+ .cse123 1) 5) 29) 0) (= (mod (+ .cse124 1) 29) 0) (<= (mod .cse124 29) .cse2) (not (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div .cse127 10))) (let ((.cse128 (div (+ .cse126 1) 5))) (and (= (mod .cse126 5) 0) (<= (mod (div .cse127 50) 29) .cse2) (= (mod (+ .cse128 1) 29) 0) (= (mod .cse127 10) 0) (not (< .cse128 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse130 (div .cse131 50)) (.cse129 (div .cse131 10))) (and (= (mod .cse129 5) 0) (= (mod (+ .cse130 1) 29) 0) (<= (mod .cse130 29) .cse2) (not (< (div (+ .cse129 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse132 (div .cse134 10)) (.cse133 (div .cse134 50))) (and (= (mod .cse132 5) 0) (<= (mod .cse133 29) .cse2) (= (mod (+ (div (+ .cse132 1) 5) 1) 29) 0) (<= 0 .cse133) (= (mod .cse134 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (+ (div .cse136 10) 1))) (and (not (< .cse135 0)) (<= (mod (div .cse135 5) 29) .cse2) (< .cse136 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse139 (div .cse138 10)) (.cse137 (mod (+ (div .cse138 50) 1) 29))) (and (= .cse137 0) (= (mod .cse138 10) 0) (not (= (mod (+ (div (+ .cse139 1) 5) 1) 29) 0)) (< .cse139 0) (<= .cse137 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse140 50))) (let ((.cse141 (mod .cse142 29))) (and (= (mod (div .cse140 10) 5) 0) (<= .cse141 .cse2) (= 0 .cse141) (= (mod .cse140 10) 0) (not (< (+ .cse142 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse144 50))) (and (<= (mod .cse143 29) .cse2) (<= 0 .cse143) (= (mod .cse144 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse147 (div (+ (div .cse146 10) 1) 5))) (let ((.cse145 (mod .cse147 29))) (and (= .cse145 0) (= (mod (+ (div .cse146 50) 1) 29) 0) (not (= (mod .cse146 10) 0)) (< (+ .cse147 1) 0) (<= .cse145 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse148 50))) (and (= (mod (div .cse148 10) 5) 0) (<= (mod .cse149 29) .cse2) (<= 0 .cse149))))))) is different from true [2022-11-20 09:41:52,546 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 ((.cse12 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse12 50)) (.cse9 (div .cse12 10))) (let ((.cse10 (div (+ .cse9 1) 5)) (.cse11 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 5) 0)) (not (= (mod .cse10 29) 0)) (<= (mod .cse11 29) .cse6) (= (mod .cse12 10) 0) (not (= (mod (+ .cse10 1) 29) 0)) (< .cse11 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (= (mod .cse18 10) 0) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (div (+ .cse19 1) 5))) (and (= (mod .cse19 5) 0) (= (mod .cse20 29) 0) (<= (mod (div .cse21 50) 29) .cse2) (<= 0 (+ .cse20 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse24 50))) (let ((.cse22 (mod .cse25 29)) (.cse23 (div .cse24 10))) (and (not (= 0 .cse22)) (= (mod .cse23 5) 0) (<= .cse22 .cse6) (= (mod .cse24 10) 0) (not (= (mod (+ (div (+ .cse23 1) 5) 1) 29) 0)) (< (+ .cse25 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse26 (+ (div .cse27 10) 1))) (and (<= (mod (div .cse26 5) 29) .cse2) (< .cse27 0) (= (mod .cse26 5) 0) (not (< (+ (div .cse27 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse28 50))) (let ((.cse29 (mod .cse30 29))) (and (= (mod (div (+ (div .cse28 10) 1) 5) 29) 0) (<= .cse29 .cse2) (= 0 .cse29) (= (mod .cse28 10) 0) (not (< (+ .cse30 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (div (* 9 v_~a29~0_899) 50))) (let ((.cse31 (mod .cse32 29))) (and (<= .cse31 .cse2) (= 0 .cse31) (not (< (+ .cse32 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse33 (div .cse35 50)) (.cse34 (div (+ (div .cse35 10) 1) 5))) (and (= (mod (+ .cse33 1) 29) 0) (<= (mod .cse33 29) .cse2) (= (mod (+ .cse34 1) 29) 0) (= (mod .cse35 10) 0) (not (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse36 (div .cse38 50)) (.cse37 (div (+ (div .cse38 10) 1) 5))) (and (= (mod (+ .cse36 1) 29) 0) (<= (mod .cse36 29) .cse2) (= (mod (+ .cse37 1) 29) 0) (not (< .cse37 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse39 (div (+ (div .cse40 10) 1) 5))) (and (= (mod .cse39 29) 0) (<= (mod (div .cse40 50) 29) .cse2) (= (mod .cse40 10) 0) (<= 0 (+ .cse39 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 50))) (and (= (mod (+ .cse41 1) 29) 0) (<= (mod .cse41 29) .cse2) (not (< (div .cse42 10) 0)) (= (mod .cse42 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse45 50)) (.cse43 (div .cse45 10))) (and (= (mod (div (+ .cse43 1) 5) 29) 0) (= (mod (+ .cse44 1) 29) 0) (<= (mod .cse44 29) .cse2) (not (< .cse43 0)) (= (mod .cse45 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse46 50))) (let ((.cse47 (mod .cse48 29))) (and (= (mod (div (+ (div .cse46 10) 1) 5) 29) 0) (<= .cse47 .cse2) (= 0 .cse47) (not (< (+ .cse48 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse51 (div .cse49 5))) (let ((.cse50 (+ .cse51 1))) (and (not (= (mod .cse49 5) 0)) (not (< .cse50 0)) (< .cse51 0) (<= (mod .cse50 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse54 10))) (let ((.cse53 (div (+ .cse52 1) 5))) (and (= (mod .cse52 5) 0) (= (mod (+ .cse53 1) 29) 0) (<= (mod (div .cse54 50) 29) .cse6) (= (mod .cse54 10) 0) (< .cse53 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse55 (div (+ (div .cse56 10) 1) 5)) (.cse57 (div .cse56 50))) (and (= (mod .cse55 29) 0) (not (= (mod .cse56 10) 0)) (<= (mod (+ .cse55 1) 29) .cse6) (= 0 (mod .cse57 29)) (< (+ .cse57 1) 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 29) .cse2) (<= 0 .cse59) (= (mod .cse58 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse61 (div .cse60 50))) (and (= (mod (div .cse60 10) 5) 0) (= (mod (+ .cse61 1) 29) 0) (<= (mod .cse61 29) .cse2) (not (< .cse61 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse63 (+ (div .cse62 10) 1)) (.cse64 (div .cse62 50))) (and (not (= (mod .cse62 10) 0)) (<= (mod (div .cse63 5) 29) .cse6) (= 0 (mod .cse64 29)) (= (mod .cse63 5) 0) (< (+ .cse64 1) 0))))) (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))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse68 50))) (and (<= (mod .cse67 29) .cse2) (= (mod (+ (div (+ (div .cse68 10) 1) 5) 1) 29) 0) (<= 0 .cse67) (= (mod .cse68 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse71 (div (+ (div .cse69 10) 1) 5))) (let ((.cse70 (mod (+ .cse71 1) 29))) (and (= (mod (+ (div .cse69 50) 1) 29) 0) (not (= (mod .cse69 10) 0)) (= .cse70 0) (< .cse71 0) (<= .cse70 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse72 (div .cse73 50))) (and (= (mod (+ .cse72 1) 29) 0) (<= (mod .cse72 29) .cse2) (not (< (div .cse73 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse74 (div .cse76 10)) (.cse75 (div .cse76 50))) (and (= (mod .cse74 5) 0) (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ .cse74 1) 5) 1) 29) 0) (<= 0 .cse75))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse81 (+ (div .cse78 10) 1))) (let ((.cse80 (div .cse81 5))) (let ((.cse79 (mod .cse80 29)) (.cse77 (div .cse78 50))) (and (not (= 0 (mod .cse77 29))) (not (= (mod .cse78 10) 0)) (not (= .cse79 0)) (<= .cse79 .cse6) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 5) 0) (< (+ .cse77 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse83 (div .cse82 50))) (and (= (mod (div (+ (div .cse82 10) 1) 5) 29) 0) (<= (mod .cse83 29) .cse2) (<= 0 .cse83))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse84 50))) (let ((.cse85 (mod .cse86 29))) (and (= (mod (div .cse84 10) 5) 0) (<= .cse85 .cse2) (= 0 .cse85) (not (< (+ .cse86 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse87 (div (+ (div .cse88 10) 1) 5))) (and (<= 0 .cse87) (<= (mod .cse87 29) .cse2) (< .cse88 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse89 (mod (div (+ (div .cse90 10) 1) 5) 29))) (and (= .cse89 0) (<= .cse89 .cse2) (< .cse90 0) (not (< (+ (div .cse90 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse91 29) .cse2) (<= 0 .cse91)))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse95 10))) (let ((.cse94 (div (+ .cse93 1) 5)) (.cse92 (mod (+ (div .cse95 50) 1) 29))) (and (= .cse92 0) (not (= (mod .cse93 5) 0)) (= (mod (+ .cse94 1) 29) 0) (= (mod .cse95 10) 0) (< .cse94 0) (<= .cse92 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse96 50))) (let ((.cse97 (mod .cse98 29))) (and (= (mod (div .cse96 10) 5) 0) (<= .cse97 .cse2) (= 0 .cse97) (= (mod .cse96 10) 0) (< (+ .cse98 1) 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 ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse120 (+ (div .cse119 10) 1))) (let ((.cse121 (div .cse120 5)) (.cse118 (+ (div .cse119 50) 1))) (and (not (= (mod .cse118 29) 0)) (not (= (mod .cse119 10) 0)) (not (= (mod .cse120 5) 0)) (not (= (mod .cse121 29) 0)) (<= (mod (+ .cse121 1) 29) .cse6) (< .cse118 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 ((.cse129 (div .cse130 50)) (.cse128 (div .cse130 10))) (and (= (mod .cse128 5) 0) (= (mod (+ .cse129 1) 29) 0) (<= (mod .cse129 29) .cse2) (not (< (div (+ .cse128 1) 5) 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 ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse146 (div (+ (div .cse145 10) 1) 5))) (let ((.cse144 (mod .cse146 29))) (and (= .cse144 0) (= (mod (+ (div .cse145 50) 1) 29) 0) (not (= (mod .cse145 10) 0)) (< (+ .cse146 1) 0) (<= .cse144 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse147 50))) (and (= (mod (div .cse147 10) 5) 0) (<= (mod .cse148 29) .cse2) (<= 0 .cse148))))))) is different from true