./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:11:00,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:11:00,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:11:00,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:11:00,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:11:00,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:11:00,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:11:00,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:11:00,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:11:00,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:11:00,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:11:00,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:11:00,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:11:00,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:11:00,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:11:00,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:11:00,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:11:00,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:11:00,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:11:00,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:11:00,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:11:00,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:11:00,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:11:00,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:11:00,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:11:00,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:11:00,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:11:00,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:11:00,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:11:00,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:11:00,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:11:00,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:11:00,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:11:00,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:11:00,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:11:00,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:11:00,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:11:00,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:11:00,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:11:00,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:11:00,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:11:00,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:11:00,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:11:00,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:11:00,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:11:00,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:11:00,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:11:00,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:11:00,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:11:00,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:11:00,953 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:11:00,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:11:00,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:11:00,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:11:00,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:11:00,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:11:00,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:11:00,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:11:00,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:11:00,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:11:00,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:11:00,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:11:00,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:11:00,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:11:00,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:11:00,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:11:00,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:11:00,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:11:00,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:11:00,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:11:00,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:11:00,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:11:00,959 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:11:00,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:11:00,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:11:00,960 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_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/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_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2022-11-16 12:11:01,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:11:01,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:11:01,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:11:01,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:11:01,315 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:11:01,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-16 12:11:01,390 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/data/0071439c5/ce9b9e40e09247ce9e75cb6cc6b04ee2/FLAG950031909 [2022-11-16 12:11:02,183 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:11:02,183 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2022-11-16 12:11:02,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/data/0071439c5/ce9b9e40e09247ce9e75cb6cc6b04ee2/FLAG950031909 [2022-11-16 12:11:02,326 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/data/0071439c5/ce9b9e40e09247ce9e75cb6cc6b04ee2 [2022-11-16 12:11:02,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:11:02,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:11:02,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:11:02,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:11:02,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:11:02,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:02" (1/1) ... [2022-11-16 12:11:02,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5b0226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:02, skipping insertion in model container [2022-11-16 12:11:02,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:02" (1/1) ... [2022-11-16 12:11:02,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:11:02,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:11:02,708 WARN L229 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_fc20c48e-2302-4ae8-bfb4-eee7924446e7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-16 12:11:03,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:11:03,333 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:11:03,375 WARN L229 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_fc20c48e-2302-4ae8-bfb4-eee7924446e7/sv-benchmarks/c/eca-rers2012/Problem15_label35.c[4490,4503] [2022-11-16 12:11:03,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:11:03,706 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:11:03,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03 WrapperNode [2022-11-16 12:11:03,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:11:03,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:11:03,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:11:03,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:11:03,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:03,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:03,953 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-16 12:11:03,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:11:03,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:11:03,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:11:03,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:11:03,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:03,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:03,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:03,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:11:04,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:11:04,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:11:04,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:11:04,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (1/1) ... [2022-11-16 12:11:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:11:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:04,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:11:04,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:11:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:11:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:11:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:11:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:11:04,408 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:11:04,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:11:08,213 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:11:08,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:11:08,236 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:11:08,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:08 BoogieIcfgContainer [2022-11-16 12:11:08,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:11:08,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:11:08,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:11:08,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:11:08,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:02" (1/3) ... [2022-11-16 12:11:08,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e61a90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:08, skipping insertion in model container [2022-11-16 12:11:08,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:03" (2/3) ... [2022-11-16 12:11:08,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e61a90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:08, skipping insertion in model container [2022-11-16 12:11:08,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:08" (3/3) ... [2022-11-16 12:11:08,258 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2022-11-16 12:11:08,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:11:08,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:11:08,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:11:08,367 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;@2d813e84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:11:08,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:11:08,378 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-16 12:11:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:11:08,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:08,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:08,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2022-11-16 12:11:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826865334] [2022-11-16 12:11:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:08,750 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-16 12:11:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826865334] [2022-11-16 12:11:08,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826865334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:08,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:08,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:08,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760515901] [2022-11-16 12:11:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:08,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:08,807 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:11,693 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-16 12:11:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:11,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 12:11:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:11,715 INFO L225 Difference]: With dead ends: 1155 [2022-11-16 12:11:11,715 INFO L226 Difference]: Without dead ends: 667 [2022-11-16 12:11:11,720 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-16 12:11:11,723 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 308 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 12:11:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-16 12:11:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-16 12:11:11,820 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-16 12:11:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-16 12:11:11,825 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 36 [2022-11-16 12:11:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:11,826 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-16 12:11:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-16 12:11:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:11:11,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:11,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:11,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:11:11,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 532908861, now seen corresponding path program 1 times [2022-11-16 12:11:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:11,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526467309] [2022-11-16 12:11:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526467309] [2022-11-16 12:11:12,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526467309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:12,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:12,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444605985] [2022-11-16 12:11:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:12,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:12,266 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:15,329 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-16 12:11:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:15,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-11-16 12:11:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:15,337 INFO L225 Difference]: With dead ends: 1953 [2022-11-16 12:11:15,337 INFO L226 Difference]: Without dead ends: 1290 [2022-11-16 12:11:15,340 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-16 12:11:15,342 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:15,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-16 12:11:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-16 12:11:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-16 12:11:15,389 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-16 12:11:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-16 12:11:15,396 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 111 [2022-11-16 12:11:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:15,397 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-16 12:11:15,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-16 12:11:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-16 12:11:15,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:15,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:11:15,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:15,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1986106637, now seen corresponding path program 1 times [2022-11-16 12:11:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:15,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786617202] [2022-11-16 12:11:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:15,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786617202] [2022-11-16 12:11:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786617202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:15,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:15,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227800536] [2022-11-16 12:11:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:15,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:15,641 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:18,440 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-16 12:11:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-11-16 12:11:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:18,449 INFO L225 Difference]: With dead ends: 3764 [2022-11-16 12:11:18,449 INFO L226 Difference]: Without dead ends: 2484 [2022-11-16 12:11:18,452 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-16 12:11:18,453 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:18,454 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.7s Time] [2022-11-16 12:11:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-16 12:11:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-16 12:11:18,504 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-16 12:11:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-16 12:11:18,511 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 115 [2022-11-16 12:11:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:18,511 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-16 12:11:18,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-16 12:11:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-16 12:11:18,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:18,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:18,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:11:18,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1703382585, now seen corresponding path program 1 times [2022-11-16 12:11:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:18,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756999675] [2022-11-16 12:11:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 12:11:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:19,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756999675] [2022-11-16 12:11:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756999675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:19,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:19,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359816195] [2022-11-16 12:11:19,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:19,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:19,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:19,006 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:21,217 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-16 12:11:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:21,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2022-11-16 12:11:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:21,231 INFO L225 Difference]: With dead ends: 6166 [2022-11-16 12:11:21,232 INFO L226 Difference]: Without dead ends: 3986 [2022-11-16 12:11:21,235 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-16 12:11:21,236 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:21,237 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.1s Time] [2022-11-16 12:11:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-16 12:11:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-16 12:11:21,343 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-16 12:11:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-16 12:11:21,355 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 206 [2022-11-16 12:11:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:21,356 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-16 12:11:21,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-16 12:11:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-16 12:11:21,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:21,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:21,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:11:21,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2135107277, now seen corresponding path program 1 times [2022-11-16 12:11:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:21,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458180799] [2022-11-16 12:11:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 12:11:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:22,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458180799] [2022-11-16 12:11:22,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458180799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:22,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:22,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:11:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359168535] [2022-11-16 12:11:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:22,334 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-16 12:11:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:24,723 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-16 12:11:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2022-11-16 12:11:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:24,741 INFO L225 Difference]: With dead ends: 7661 [2022-11-16 12:11:24,742 INFO L226 Difference]: Without dead ends: 3981 [2022-11-16 12:11:24,746 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-16 12:11:24,748 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:24,748 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.3s Time] [2022-11-16 12:11:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-16 12:11:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-16 12:11:24,885 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-16 12:11:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-16 12:11:24,896 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 308 [2022-11-16 12:11:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:24,897 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-16 12:11:24,899 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-16 12:11:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-16 12:11:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-11-16 12:11:24,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:24,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:24,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:11:24,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1741911394, now seen corresponding path program 1 times [2022-11-16 12:11:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:24,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680581389] [2022-11-16 12:11:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:11:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:25,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680581389] [2022-11-16 12:11:25,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680581389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:25,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:25,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958652270] [2022-11-16 12:11:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:25,365 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:28,153 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-16 12:11:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2022-11-16 12:11:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:28,176 INFO L225 Difference]: With dead ends: 9465 [2022-11-16 12:11:28,176 INFO L226 Difference]: Without dead ends: 5785 [2022-11-16 12:11:28,181 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-16 12:11:28,183 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 280 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:28,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-16 12:11:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-16 12:11:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-16 12:11:28,317 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-16 12:11:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-16 12:11:28,331 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 323 [2022-11-16 12:11:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:28,332 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-16 12:11:28,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-16 12:11:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-11-16 12:11:28,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:28,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:28,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:11:28,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1792802591, now seen corresponding path program 1 times [2022-11-16 12:11:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:28,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114019783] [2022-11-16 12:11:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:11:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:28,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114019783] [2022-11-16 12:11:28,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114019783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:28,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:28,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408665657] [2022-11-16 12:11:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:28,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:28,950 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:31,501 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-16 12:11:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2022-11-16 12:11:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:31,539 INFO L225 Difference]: With dead ends: 13364 [2022-11-16 12:11:31,539 INFO L226 Difference]: Without dead ends: 7882 [2022-11-16 12:11:31,546 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-16 12:11:31,550 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 291 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:31,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 12:11:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-16 12:11:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-16 12:11:31,709 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-16 12:11:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-16 12:11:31,729 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 382 [2022-11-16 12:11:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:31,730 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-16 12:11:31,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-16 12:11:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-11-16 12:11:31,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:31,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:11:31,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 746313456, now seen corresponding path program 1 times [2022-11-16 12:11:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787898549] [2022-11-16 12:11:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:11:32,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787898549] [2022-11-16 12:11:32,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787898549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:32,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989385288] [2022-11-16 12:11:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:32,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:32,229 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:34,910 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-16 12:11:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2022-11-16 12:11:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:34,940 INFO L225 Difference]: With dead ends: 16069 [2022-11-16 12:11:34,940 INFO L226 Difference]: Without dead ends: 9086 [2022-11-16 12:11:34,947 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-16 12:11:34,948 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 293 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:34,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-16 12:11:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-16 12:11:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-16 12:11:35,098 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-16 12:11:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-16 12:11:35,115 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 397 [2022-11-16 12:11:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:35,117 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-16 12:11:35,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-16 12:11:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2022-11-16 12:11:35,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:35,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:35,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:11:35,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 843512261, now seen corresponding path program 1 times [2022-11-16 12:11:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:35,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625553533] [2022-11-16 12:11:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 12:11:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:35,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625553533] [2022-11-16 12:11:35,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625553533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:35,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:35,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461871340] [2022-11-16 12:11:35,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:35,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:35,755 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-16 12:11:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:38,553 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-16 12:11:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 487 [2022-11-16 12:11:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:38,578 INFO L225 Difference]: With dead ends: 19651 [2022-11-16 12:11:38,578 INFO L226 Difference]: Without dead ends: 11471 [2022-11-16 12:11:38,587 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-16 12:11:38,588 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:38,589 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.7s Time] [2022-11-16 12:11:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-16 12:11:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-16 12:11:38,745 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-16 12:11:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-16 12:11:38,760 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 487 [2022-11-16 12:11:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:38,762 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-16 12:11:38,762 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-16 12:11:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-16 12:11:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2022-11-16 12:11:38,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:38,779 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:11:38,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1011437163, now seen corresponding path program 1 times [2022-11-16 12:11:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:38,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225773826] [2022-11-16 12:11:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 477 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-11-16 12:11:39,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:39,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225773826] [2022-11-16 12:11:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225773826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143401888] [2022-11-16 12:11:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:39,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:39,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:11:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:40,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:11:40,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-16 12:11:40,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:11:40,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143401888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:40,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:11:40,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 12:11:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538487862] [2022-11-16 12:11:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:40,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:40,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:40,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:40,374 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:43,103 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-16 12:11:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520 [2022-11-16 12:11:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:43,132 INFO L225 Difference]: With dead ends: 17246 [2022-11-16 12:11:43,132 INFO L226 Difference]: Without dead ends: 9969 [2022-11-16 12:11:43,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:43,142 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 381 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:43,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-16 12:11:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-16 12:11:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-16 12:11:43,310 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-16 12:11:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-16 12:11:43,327 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 520 [2022-11-16 12:11:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:43,328 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-16 12:11:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-16 12:11:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2022-11-16 12:11:43,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:43,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:43,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:43,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:11:43,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:43,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1710037215, now seen corresponding path program 1 times [2022-11-16 12:11:43,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:43,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198132459] [2022-11-16 12:11:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:43,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-16 12:11:44,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:44,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198132459] [2022-11-16 12:11:44,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198132459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:44,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:44,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164433706] [2022-11-16 12:11:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:44,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:44,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:44,351 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:47,242 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-16 12:11:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2022-11-16 12:11:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:47,275 INFO L225 Difference]: With dead ends: 24136 [2022-11-16 12:11:47,275 INFO L226 Difference]: Without dead ends: 14468 [2022-11-16 12:11:47,285 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-16 12:11:47,286 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:47,286 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.8s Time] [2022-11-16 12:11:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-16 12:11:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-16 12:11:47,492 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-16 12:11:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-16 12:11:47,520 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 524 [2022-11-16 12:11:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:47,521 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-16 12:11:47,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-16 12:11:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-11-16 12:11:47,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:47,532 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:47,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:11:47,533 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -531161142, now seen corresponding path program 1 times [2022-11-16 12:11:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:47,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847701015] [2022-11-16 12:11:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 634 proven. 39 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2022-11-16 12:11:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847701015] [2022-11-16 12:11:48,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847701015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:48,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287216763] [2022-11-16 12:11:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:48,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:48,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:48,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:11:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:11:49,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-16 12:11:49,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:11:49,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287216763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:49,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:11:49,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 12:11:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053928370] [2022-11-16 12:11:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:49,359 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:51,821 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-16 12:11:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 599 [2022-11-16 12:11:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:51,845 INFO L225 Difference]: With dead ends: 27712 [2022-11-16 12:11:51,845 INFO L226 Difference]: Without dead ends: 13855 [2022-11-16 12:11:51,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:51,860 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:51,861 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.3s Time] [2022-11-16 12:11:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-16 12:11:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-16 12:11:52,051 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-16 12:11:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-16 12:11:52,074 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 599 [2022-11-16 12:11:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:52,075 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-16 12:11:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:11:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-16 12:11:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2022-11-16 12:11:52,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:52,091 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:11:52,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:11:52,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:11:52,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:11:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1926565044, now seen corresponding path program 1 times [2022-11-16 12:11:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:52,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956608565] [2022-11-16 12:11:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-16 12:11:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956608565] [2022-11-16 12:11:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956608565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:11:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082421193] [2022-11-16 12:11:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:11:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:11:53,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:11:53,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:11:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:53,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:11:53,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:11:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-16 12:11:54,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:11:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-16 12:11:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082421193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:11:56,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:11:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-16 12:11:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487690475] [2022-11-16 12:11:56,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:11:56,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:11:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:56,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:11:56,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:11:56,036 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-16 12:12:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:05,727 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-16 12:12:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:12:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 600 [2022-11-16 12:12:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:05,748 INFO L225 Difference]: With dead ends: 35741 [2022-11-16 12:12:05,749 INFO L226 Difference]: Without dead ends: 16247 [2022-11-16 12:12:05,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1209 GetRequests, 1194 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:12:05,761 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2894 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5609 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 5609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:05,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2894 Valid, 242 Invalid, 6257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 5609 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-11-16 12:12:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-16 12:12:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-16 12:12:06,070 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-16 12:12:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-16 12:12:06,089 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 600 [2022-11-16 12:12:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-16 12:12:06,090 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-16 12:12:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-16 12:12:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2022-11-16 12:12:06,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:06,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:06,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:06,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:12:06,309 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 366324416, now seen corresponding path program 1 times [2022-11-16 12:12:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:06,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388256168] [2022-11-16 12:12:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-16 12:12:06,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388256168] [2022-11-16 12:12:06,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388256168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:06,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:06,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:12:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389932198] [2022-11-16 12:12:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:06,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:12:06,860 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:08,487 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-16 12:12:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 637 [2022-11-16 12:12:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:08,507 INFO L225 Difference]: With dead ends: 28295 [2022-11-16 12:12:08,507 INFO L226 Difference]: Without dead ends: 15940 [2022-11-16 12:12:08,515 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-16 12:12:08,516 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 278 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:08,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:12:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-16 12:12:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-16 12:12:08,810 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-16 12:12:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-16 12:12:08,830 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 637 [2022-11-16 12:12:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:08,831 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-16 12:12:08,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-16 12:12:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-11-16 12:12:08,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:08,845 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:08,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:12:08,846 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1686621216, now seen corresponding path program 1 times [2022-11-16 12:12:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184422624] [2022-11-16 12:12:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:12:09,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:09,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184422624] [2022-11-16 12:12:09,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184422624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:09,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:09,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:12:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335807894] [2022-11-16 12:12:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:09,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:12:09,731 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:11,297 INFO L93 Difference]: Finished difference Result 33081 states and 34229 transitions. [2022-11-16 12:12:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 661 [2022-11-16 12:12:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:11,314 INFO L225 Difference]: With dead ends: 33081 [2022-11-16 12:12:11,314 INFO L226 Difference]: Without dead ends: 18339 [2022-11-16 12:12:11,323 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-16 12:12:11,324 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 87 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:11,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 512 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:12:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18339 states. [2022-11-16 12:12:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18339 to 18038. [2022-11-16 12:12:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18038 states, 18037 states have (on average 1.0326550978544105) internal successors, (18626), 18037 states have internal predecessors, (18626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 18626 transitions. [2022-11-16 12:12:11,594 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 18626 transitions. Word has length 661 [2022-11-16 12:12:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:11,595 INFO L495 AbstractCegarLoop]: Abstraction has 18038 states and 18626 transitions. [2022-11-16 12:12:11,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 18626 transitions. [2022-11-16 12:12:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2022-11-16 12:12:11,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:11,616 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:11,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:12:11,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1912380469, now seen corresponding path program 1 times [2022-11-16 12:12:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:11,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601263990] [2022-11-16 12:12:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-16 12:12:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:12,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601263990] [2022-11-16 12:12:12,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601263990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:12,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:12,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:12:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376370939] [2022-11-16 12:12:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:12,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:12:12,418 INFO L87 Difference]: Start difference. First operand 18038 states and 18626 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:14,136 INFO L93 Difference]: Finished difference Result 38762 states and 40068 transitions. [2022-11-16 12:12:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 763 [2022-11-16 12:12:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:14,159 INFO L225 Difference]: With dead ends: 38762 [2022-11-16 12:12:14,159 INFO L226 Difference]: Without dead ends: 20726 [2022-11-16 12:12:14,171 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-16 12:12:14,172 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:14,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 171 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:12:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20726 states. [2022-11-16 12:12:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 19829. [2022-11-16 12:12:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19828 states have (on average 1.030260238047206) internal successors, (20428), 19828 states have internal predecessors, (20428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 20428 transitions. [2022-11-16 12:12:14,427 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 20428 transitions. Word has length 763 [2022-11-16 12:12:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:14,428 INFO L495 AbstractCegarLoop]: Abstraction has 19829 states and 20428 transitions. [2022-11-16 12:12:14,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 20428 transitions. [2022-11-16 12:12:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2022-11-16 12:12:14,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:14,451 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:12:14,452 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 160756345, now seen corresponding path program 1 times [2022-11-16 12:12:14,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:14,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708656682] [2022-11-16 12:12:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-11-16 12:12:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:15,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708656682] [2022-11-16 12:12:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708656682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:15,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:15,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:12:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511508286] [2022-11-16 12:12:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:15,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:12:15,247 INFO L87 Difference]: Start difference. First operand 19829 states and 20428 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:16,771 INFO L93 Difference]: Finished difference Result 42641 states and 44001 transitions. [2022-11-16 12:12:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:16,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 821 [2022-11-16 12:12:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:16,790 INFO L225 Difference]: With dead ends: 42641 [2022-11-16 12:12:16,791 INFO L226 Difference]: Without dead ends: 23113 [2022-11-16 12:12:16,800 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-16 12:12:16,800 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:16,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 505 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 12:12:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23113 states. [2022-11-16 12:12:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23113 to 19820. [2022-11-16 12:12:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.0282052575811091) internal successors, (20378), 19819 states have internal predecessors, (20378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 20378 transitions. [2022-11-16 12:12:17,043 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 20378 transitions. Word has length 821 [2022-11-16 12:12:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:17,044 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 20378 transitions. [2022-11-16 12:12:17,044 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-16 12:12:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 20378 transitions. [2022-11-16 12:12:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-16 12:12:17,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:17,062 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:17,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:12:17,063 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1504524939, now seen corresponding path program 1 times [2022-11-16 12:12:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:17,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551718487] [2022-11-16 12:12:17,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:17,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 587 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-16 12:12:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551718487] [2022-11-16 12:12:19,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551718487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108535869] [2022-11-16 12:12:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:19,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:19,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:12:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:19,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:12:19,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:12:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-16 12:12:19,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:12:19,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108535869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:19,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:12:19,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 12:12:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459935855] [2022-11-16 12:12:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:19,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:19,756 INFO L87 Difference]: Start difference. First operand 19820 states and 20378 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:21,577 INFO L93 Difference]: Finished difference Result 43838 states and 45054 transitions. [2022-11-16 12:12:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 842 [2022-11-16 12:12:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:21,685 INFO L225 Difference]: With dead ends: 43838 [2022-11-16 12:12:21,685 INFO L226 Difference]: Without dead ends: 24319 [2022-11-16 12:12:21,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:21,698 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 293 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:21,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 496 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 12:12:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2022-11-16 12:12:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 21917. [2022-11-16 12:12:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21917 states, 21916 states have (on average 1.0275141449169556) internal successors, (22519), 21916 states have internal predecessors, (22519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21917 states to 21917 states and 22519 transitions. [2022-11-16 12:12:22,080 INFO L78 Accepts]: Start accepts. Automaton has 21917 states and 22519 transitions. Word has length 842 [2022-11-16 12:12:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:22,081 INFO L495 AbstractCegarLoop]: Abstraction has 21917 states and 22519 transitions. [2022-11-16 12:12:22,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21917 states and 22519 transitions. [2022-11-16 12:12:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2022-11-16 12:12:22,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:22,104 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:22,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:12:22,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:12:22,317 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1397744587, now seen corresponding path program 1 times [2022-11-16 12:12:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:22,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638842805] [2022-11-16 12:12:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2022-11-16 12:12:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:23,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638842805] [2022-11-16 12:12:23,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638842805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:23,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:23,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:12:23,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495211609] [2022-11-16 12:12:23,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:23,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:12:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:12:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:12:23,461 INFO L87 Difference]: Start difference. First operand 21917 states and 22519 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:25,267 INFO L93 Difference]: Finished difference Result 47734 states and 49018 transitions. [2022-11-16 12:12:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:12:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 875 [2022-11-16 12:12:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:25,290 INFO L225 Difference]: With dead ends: 47734 [2022-11-16 12:12:25,290 INFO L226 Difference]: Without dead ends: 25819 [2022-11-16 12:12:25,300 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-16 12:12:25,301 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:25,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 492 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-16 12:12:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25819 states. [2022-11-16 12:12:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25819 to 21615. [2022-11-16 12:12:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21615 states, 21614 states have (on average 1.0270657906912186) internal successors, (22199), 21614 states have internal predecessors, (22199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 22199 transitions. [2022-11-16 12:12:25,550 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 22199 transitions. Word has length 875 [2022-11-16 12:12:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:25,550 INFO L495 AbstractCegarLoop]: Abstraction has 21615 states and 22199 transitions. [2022-11-16 12:12:25,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:12:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 22199 transitions. [2022-11-16 12:12:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2022-11-16 12:12:25,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:25,565 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:12:25,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:12:25,566 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:12:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash -547488288, now seen corresponding path program 1 times [2022-11-16 12:12:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:25,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760156990] [2022-11-16 12:12:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 661 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-16 12:12:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760156990] [2022-11-16 12:12:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760156990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:12:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126091531] [2022-11-16 12:12:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:27,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:12:27,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:12:27,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:12:27,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc20c48e-2302-4ae8-bfb4-eee7924446e7/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:12:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:28,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:12:28,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:20,942 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 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 ((.cse6 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse6 50)) (.cse9 (+ (div .cse6 10) 1))) (let ((.cse7 (div .cse9 5)) (.cse5 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 29) 0)) (not (= (mod .cse6 10) 0)) (<= (mod .cse7 29) .cse8) (not (= (mod (+ .cse7 1) 29) 0)) (= (mod .cse9 5) 0) (< .cse5 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse12 (* 9 v_~a29~0_899))) (let ((.cse10 (div .cse12 10))) (let ((.cse11 (div (+ .cse10 1) 5))) (and (= (mod .cse10 5) 0) (= (mod .cse11 29) 0) (<= (mod (div .cse12 50) 29) .cse2) (= (mod .cse12 10) 0) (<= 0 (+ .cse11 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (<= 0 (+ .cse14 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse17 (* 9 v_~a29~0_899))) (let ((.cse16 (+ (div .cse17 10) 1))) (and (<= (mod (div .cse16 5) 29) .cse2) (< .cse17 0) (= (mod .cse16 5) 0) (not (< (+ (div .cse17 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse20 (div .cse18 50))) (let ((.cse19 (mod .cse20 29))) (and (= (mod (div (+ (div .cse18 10) 1) 5) 29) 0) (<= .cse19 .cse2) (= 0 .cse19) (= (mod .cse18 10) 0) (not (< (+ .cse20 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse22 (div (* 9 v_~a29~0_899) 50))) (let ((.cse21 (mod .cse22 29))) (and (<= .cse21 .cse2) (= 0 .cse21) (not (< (+ .cse22 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (* 9 v_~a29~0_899))) (let ((.cse23 (div .cse25 50)) (.cse24 (div (+ (div .cse25 10) 1) 5))) (and (= (mod (+ .cse23 1) 29) 0) (<= (mod .cse23 29) .cse2) (= (mod (+ .cse24 1) 29) 0) (= (mod .cse25 10) 0) (not (< .cse24 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse29 (+ (div .cse28 10) 1))) (let ((.cse26 (div .cse28 50)) (.cse27 (div .cse29 5))) (and (not (= 0 (mod .cse26 29))) (not (= (mod (+ .cse26 1) 29) 0)) (= (mod .cse27 29) 0) (not (= (mod .cse28 10) 0)) (not (= (mod .cse29 5) 0)) (<= (mod (+ .cse27 1) 29) .cse8)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (not (< .cse31 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod .cse33 29) 0) (<= (mod (div .cse34 50) 29) .cse2) (= (mod .cse34 10) 0) (<= 0 (+ .cse33 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse36 50))) (and (= (mod (+ .cse35 1) 29) 0) (<= (mod .cse35 29) .cse2) (not (< (div .cse36 10) 0)) (= (mod .cse36 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse39 50)) (.cse37 (div .cse39 10))) (and (= (mod (div (+ .cse37 1) 5) 29) 0) (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (not (< .cse37 0)) (= (mod .cse39 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse42 (div .cse40 50))) (let ((.cse41 (mod .cse42 29))) (and (= (mod (div (+ (div .cse40 10) 1) 5) 29) 0) (<= .cse41 .cse2) (= 0 .cse41) (not (< (+ .cse42 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse45 (div .cse43 5))) (let ((.cse44 (+ .cse45 1))) (and (not (= (mod .cse43 5) 0)) (not (< .cse44 0)) (< .cse45 0) (<= (mod .cse44 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (and (not (= (mod .cse46 10) 0)) (= (mod (+ (div (+ (div .cse46 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse46 50) 29))))) (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) .cse8) (= (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) .cse8) (= 0 (mod .cse52 29)) (< (+ .cse52 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse53 (div .cse55 50))) (let ((.cse56 (+ .cse53 1))) (let ((.cse54 (mod .cse56 29))) (and (not (= 0 (mod .cse53 29))) (not (= .cse54 0)) (= (mod (+ (div (+ (div .cse55 10) 1) 5) 1) 29) 0) (<= .cse54 .cse8) (= (mod .cse55 10) 0) (< .cse56 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse57 50))) (and (= (mod (div .cse57 10) 5) 0) (<= (mod .cse58 29) .cse2) (<= 0 .cse58) (= (mod .cse57 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (= (mod (+ .cse60 1) 29) 0) (<= (mod .cse60 29) .cse2) (not (< .cse60 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (+ (div .cse61 10) 1)) (.cse63 (div .cse61 50))) (and (not (= (mod .cse61 10) 0)) (<= (mod (div .cse62 5) 29) .cse8) (= 0 (mod .cse63 29)) (= (mod .cse62 5) 0) (< (+ .cse63 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse65 (+ (div .cse64 10) 1))) (and (= (mod (+ (div .cse64 50) 1) 29) 0) (not (= (mod .cse64 10) 0)) (not (= (mod .cse65 5) 0)) (not (= (mod (+ (div .cse65 5) 1) 29) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse69 50))) (and (<= (mod .cse68 29) .cse2) (= (mod (+ (div (+ (div .cse69 10) 1) 5) 1) 29) 0) (<= 0 .cse68) (= (mod .cse69 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse72 (div (+ (div .cse70 10) 1) 5))) (let ((.cse71 (mod (+ .cse72 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (= .cse71 0) (< .cse72 0) (<= .cse71 .cse2)))))) (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 ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse79 (div .cse78 50))) (and (= (mod (div (+ (div .cse78 10) 1) 5) 29) 0) (<= (mod .cse79 29) .cse2) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse80 50))) (let ((.cse81 (mod .cse82 29))) (and (= (mod (div .cse80 10) 5) 0) (<= .cse81 .cse2) (= 0 .cse81) (not (< (+ .cse82 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse83 (div (+ (div .cse84 10) 1) 5))) (and (<= 0 .cse83) (<= (mod .cse83 29) .cse2) (< .cse84 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse87 10)) (.cse86 (mod (+ (div .cse87 50) 1) 29))) (and (= (mod (div (+ .cse85 1) 5) 29) 0) (= .cse86 0) (= (mod .cse87 10) 0) (< .cse85 0) (<= .cse86 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse88 (mod (div (+ (div .cse89 10) 1) 5) 29))) (and (= .cse88 0) (<= .cse88 .cse2) (< .cse89 0) (not (< (+ (div .cse89 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse94 50)) (.cse90 (div .cse94 10))) (let ((.cse91 (div (+ .cse90 1) 5)) (.cse93 (+ .cse92 1))) (and (not (= (mod .cse90 5) 0)) (not (= (mod .cse91 29) 0)) (= 0 (mod .cse92 29)) (<= (mod .cse93 29) .cse8) (= (mod .cse94 10) 0) (not (= (mod (+ .cse91 1) 29) 0)) (< .cse93 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse95 29) .cse2) (<= 0 .cse95)))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse96 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse96 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse97 50))) (and (= (mod (+ (div (+ (div .cse97 10) 1) 5) 1) 29) 0) (= 0 (mod .cse98 29)) (not (< (+ .cse98 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse100 (div .cse102 10))) (let ((.cse101 (div (+ .cse100 1) 5)) (.cse99 (mod (+ (div .cse102 50) 1) 29))) (and (= .cse99 0) (not (= (mod .cse100 5) 0)) (= (mod (+ .cse101 1) 29) 0) (= (mod .cse102 10) 0) (< .cse101 0) (<= .cse99 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse103 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse103 50))) (let ((.cse104 (mod .cse105 29))) (and (= (mod (div .cse103 10) 5) 0) (<= .cse104 .cse2) (= 0 .cse104) (= (mod .cse103 10) 0) (< (+ .cse105 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse106 (div .cse110 50))) (let ((.cse108 (div .cse110 10)) (.cse111 (+ .cse106 1))) (let ((.cse107 (mod .cse111 29)) (.cse109 (div (+ .cse108 1) 5))) (and (not (= 0 (mod .cse106 29))) (not (= .cse107 0)) (not (= (mod .cse108 5) 0)) (not (= (mod .cse109 29) 0)) (<= .cse107 .cse8) (= (mod .cse110 10) 0) (not (= (mod (+ .cse109 1) 29) 0)) (< .cse111 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse114 50))) (let ((.cse115 (+ .cse112 1))) (let ((.cse113 (mod .cse115 29))) (and (not (= 0 (mod .cse112 29))) (not (= .cse113 0)) (= (mod (div (+ (div .cse114 10) 1) 5) 29) 0) (<= .cse113 .cse8) (= (mod .cse114 10) 0) (< .cse115 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse119 50))) (let ((.cse116 (div .cse119 10)) (.cse118 (+ .cse117 1))) (and (= (mod (div (+ .cse116 1) 5) 29) 0) (not (= (mod .cse116 5) 0)) (= 0 (mod .cse117 29)) (<= (mod .cse118 29) .cse8) (= (mod .cse119 10) 0) (< .cse118 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse122 (div .cse121 50))) (let ((.cse120 (mod .cse122 29))) (and (<= .cse120 .cse2) (= 0 .cse120) (= (mod .cse121 10) 0) (not (< (+ .cse122 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse126 (+ (div .cse124 10) 1))) (let ((.cse125 (div .cse126 5)) (.cse123 (+ (div .cse124 50) 1))) (and (not (= (mod .cse123 29) 0)) (not (= (mod .cse124 10) 0)) (= (mod (+ .cse125 1) 29) 0) (<= (mod .cse125 29) .cse8) (= (mod .cse126 5) 0) (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse127 50))) (and (= (mod (div .cse127 10) 5) 0) (= (mod (+ .cse128 1) 29) 0) (<= (mod .cse128 29) .cse2) (not (< .cse128 0)) (= (mod .cse127 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse130 (div (+ (div .cse131 10) 1) 5))) (let ((.cse129 (mod .cse130 29))) (and (= .cse129 0) (not (< (+ .cse130 1) 0)) (<= .cse129 .cse2) (< .cse131 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse135 10)) (.cse136 (div .cse135 50))) (let ((.cse132 (mod .cse136 29)) (.cse134 (div (+ .cse133 1) 5))) (and (not (= 0 .cse132)) (= (mod .cse133 5) 0) (not (= (mod .cse134 29) 0)) (<= .cse132 .cse8) (= (mod .cse135 10) 0) (not (= (mod (+ .cse134 1) 29) 0)) (< (+ .cse136 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse138 (* 9 v_~a29~0_899))) (let ((.cse137 (div (+ (div .cse138 10) 1) 5))) (and (< .cse137 0) (<= (mod (+ .cse137 1) 29) .cse2) (not (< (+ (div .cse138 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse139 (div (+ (div .cse140 10) 1) 5))) (and (not (< (+ .cse139 1) 0)) (<= (mod .cse139 29) .cse8) (< (+ (div .cse140 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse143 (+ (div .cse142 10) 1))) (let ((.cse141 (div .cse143 5))) (and (= (mod .cse141 29) 0) (= (mod (+ (div .cse142 50) 1) 29) 0) (not (= (mod .cse142 10) 0)) (not (= (mod .cse143 5) 0)) (<= (mod (+ .cse141 1) 29) .cse8)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse146 50)) (.cse144 (div .cse146 10))) (and (= (mod (div (+ .cse144 1) 5) 29) 0) (= (mod (+ .cse145 1) 29) 0) (<= (mod .cse145 29) .cse2) (not (< .cse144 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse148 10))) (let ((.cse149 (div (+ .cse147 1) 5))) (and (= (mod .cse147 5) 0) (<= (mod (div .cse148 50) 29) .cse2) (= (mod (+ .cse149 1) 29) 0) (= (mod .cse148 10) 0) (not (< .cse149 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse152 50)) (.cse150 (div .cse152 10))) (and (= (mod .cse150 5) 0) (= (mod (+ .cse151 1) 29) 0) (<= (mod .cse151 29) .cse2) (not (< (div (+ .cse150 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse155 (* 9 v_~a29~0_899))) (let ((.cse153 (div .cse155 10)) (.cse154 (div .cse155 50))) (and (= (mod .cse153 5) 0) (<= (mod .cse154 29) .cse2) (= (mod (+ (div (+ .cse153 1) 5) 1) 29) 0) (<= 0 .cse154) (= (mod .cse155 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse156 (+ (div .cse157 10) 1))) (and (not (< .cse156 0)) (<= (mod (div .cse156 5) 29) .cse2) (< .cse157 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse158 (* 9 v_~a29~0_899))) (let ((.cse160 (div .cse158 50))) (let ((.cse159 (mod .cse160 29))) (and (= (mod (div .cse158 10) 5) 0) (<= .cse159 .cse2) (= 0 .cse159) (= (mod .cse158 10) 0) (not (< (+ .cse160 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse162 (* 9 v_~a29~0_899))) (let ((.cse161 (div .cse162 50))) (and (<= (mod .cse161 29) .cse2) (<= 0 .cse161) (= (mod .cse162 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse165 (* 9 v_~a29~0_899))) (let ((.cse166 (+ (div .cse165 10) 1))) (let ((.cse163 (div .cse165 50)) (.cse167 (div .cse166 5))) (let ((.cse168 (mod (+ .cse167 1) 29)) (.cse164 (+ .cse163 1))) (and (not (= 0 (mod .cse163 29))) (not (= (mod .cse164 29) 0)) (not (= (mod .cse165 10) 0)) (not (= (mod .cse166 5) 0)) (not (= (mod .cse167 29) 0)) (<= .cse168 .cse8) (not (= .cse168 0)) (< .cse164 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse170 (* 9 v_~a29~0_899))) (let ((.cse171 (div (+ (div .cse170 10) 1) 5))) (let ((.cse169 (mod .cse171 29))) (and (= .cse169 0) (= (mod (+ (div .cse170 50) 1) 29) 0) (not (= (mod .cse170 10) 0)) (< (+ .cse171 1) 0) (<= .cse169 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse172 (* 9 v_~a29~0_899))) (let ((.cse173 (div .cse172 50))) (and (= (mod (div .cse172 10) 5) 0) (<= (mod .cse173 29) .cse2) (<= 0 .cse173))))))) is different from true [2022-11-16 12:21:41,352 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 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 ((.cse6 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse6 50)) (.cse9 (+ (div .cse6 10) 1))) (let ((.cse7 (div .cse9 5)) (.cse5 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 29) 0)) (not (= (mod .cse6 10) 0)) (<= (mod .cse7 29) .cse8) (not (= (mod (+ .cse7 1) 29) 0)) (= (mod .cse9 5) 0) (< .cse5 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5))) (and (not (= (mod .cse10 10) 0)) (= (mod (+ .cse11 1) 29) 0) (<= (mod .cse11 29) .cse8) (= (mod .cse12 5) 0) (< (+ (div .cse10 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (= (mod .cse15 10) 0) (<= 0 (+ .cse14 1))))))) (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) (<= 0 (+ .cse17 1))))))) (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 ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse27 50))) (let ((.cse24 (div (+ (div .cse27 10) 1) 5)) (.cse26 (+ .cse25 1))) (and (not (= (mod .cse24 29) 0)) (= 0 (mod .cse25 29)) (<= (mod .cse26 29) .cse8) (= (mod .cse27 10) 0) (not (= (mod (+ .cse24 1) 29) 0)) (< .cse26 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (div (* 9 v_~a29~0_899) 50))) (let ((.cse28 (mod .cse29 29))) (and (<= .cse28 .cse2) (= 0 .cse28) (not (< (+ .cse29 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (= (mod .cse32 10) 0) (not (< .cse31 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) (not (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (* 9 v_~a29~0_899))) (let ((.cse36 (div (+ (div .cse37 10) 1) 5))) (and (= (mod .cse36 29) 0) (<= (mod (div .cse37 50) 29) .cse2) (= (mod .cse37 10) 0) (<= 0 (+ .cse36 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse39 50))) (and (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (not (< (div .cse39 10) 0)) (= (mod .cse39 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 50)) (.cse40 (div .cse42 10))) (and (= (mod (div (+ .cse40 1) 5) 29) 0) (= (mod (+ .cse41 1) 29) 0) (<= (mod .cse41 29) .cse2) (not (< .cse40 0)) (= (mod .cse42 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse45 (div .cse43 50))) (let ((.cse44 (mod .cse45 29))) (and (= (mod (div (+ (div .cse43 10) 1) 5) 29) 0) (<= .cse44 .cse2) (= 0 .cse44) (not (< (+ .cse45 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse48 (div .cse46 5))) (let ((.cse47 (+ .cse48 1))) (and (not (= (mod .cse46 5) 0)) (not (< .cse47 0)) (< .cse48 0) (<= (mod .cse47 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse51 10))) (let ((.cse50 (div (+ .cse49 1) 5))) (and (= (mod .cse49 5) 0) (= (mod (+ .cse50 1) 29) 0) (<= (mod (div .cse51 50) 29) .cse8) (= (mod .cse51 10) 0) (< .cse50 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse52 (div (+ (div .cse53 10) 1) 5)) (.cse54 (div .cse53 50))) (and (= (mod .cse52 29) 0) (not (= (mod .cse53 10) 0)) (<= (mod (+ .cse52 1) 29) .cse8) (= 0 (mod .cse54 29)) (< (+ .cse54 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse57 50))) (let ((.cse58 (+ .cse55 1))) (let ((.cse56 (mod .cse58 29))) (and (not (= 0 (mod .cse55 29))) (not (= .cse56 0)) (= (mod (+ (div (+ (div .cse57 10) 1) 5) 1) 29) 0) (<= .cse56 .cse8) (= (mod .cse57 10) 0) (< .cse58 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (<= (mod .cse60 29) .cse2) (<= 0 .cse60) (= (mod .cse59 10) 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 1) 29) 0) (<= (mod .cse62 29) .cse2) (not (< .cse62 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (+ (div .cse63 10) 1)) (.cse65 (div .cse63 50))) (and (not (= (mod .cse63 10) 0)) (<= (mod (div .cse64 5) 29) .cse8) (= 0 (mod .cse65 29)) (= (mod .cse64 5) 0) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse69 50))) (and (<= (mod .cse68 29) .cse2) (= (mod (+ (div (+ (div .cse69 10) 1) 5) 1) 29) 0) (<= 0 .cse68) (= (mod .cse69 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse72 (div (+ (div .cse70 10) 1) 5))) (let ((.cse71 (mod (+ .cse72 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (= .cse71 0) (< .cse72 0) (<= .cse71 .cse2)))))) (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 ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse79 (div .cse78 50))) (and (= (mod (div (+ (div .cse78 10) 1) 5) 29) 0) (<= (mod .cse79 29) .cse2) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse82 50)) (.cse81 (div (+ (div .cse82 10) 1) 5))) (and (not (= 0 (mod .cse80 29))) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 29) 0) (not (= (mod .cse82 10) 0)) (<= (mod (+ .cse81 1) 29) .cse8))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10)) (.cse89 (mod (+ (div .cse90 50) 1) 29))) (and (= (mod (div (+ .cse88 1) 5) 29) 0) (= .cse89 0) (= (mod .cse90 10) 0) (< .cse88 0) (<= .cse89 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (mod (div (+ (div .cse92 10) 1) 5) 29))) (and (= .cse91 0) (<= .cse91 .cse2) (< .cse92 0) (not (< (+ (div .cse92 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse93 29) .cse2) (<= 0 .cse93)))) (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 .cse8) (= (mod .cse105 10) 0) (not (= (mod (+ .cse104 1) 29) 0)) (< .cse106 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse110 50))) (let ((.cse107 (div .cse110 10)) (.cse109 (+ .cse108 1))) (and (= (mod (div (+ .cse107 1) 5) 29) 0) (not (= (mod .cse107 5) 0)) (= 0 (mod .cse108 29)) (<= (mod .cse109 29) .cse8) (= (mod .cse110 10) 0) (< .cse109 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (let ((.cse111 (mod .cse113 29))) (and (<= .cse111 .cse2) (= 0 .cse111) (= (mod .cse112 10) 0) (not (< (+ .cse113 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse114 50))) (and (= (mod (div .cse114 10) 5) 0) (= (mod (+ .cse115 1) 29) 0) (<= (mod .cse115 29) .cse2) (not (< .cse115 0)) (= (mod .cse114 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse117 (div (+ (div .cse118 10) 1) 5))) (let ((.cse116 (mod .cse117 29))) (and (= .cse116 0) (not (< (+ .cse117 1) 0)) (<= .cse116 .cse2) (< .cse118 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse119 (div (+ (div .cse120 10) 1) 5))) (and (< .cse119 0) (<= (mod (+ .cse119 1) 29) .cse2) (not (< (+ (div .cse120 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5))) (and (not (< (+ .cse121 1) 0)) (<= (mod .cse121 29) .cse8) (< (+ (div .cse122 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse123 (div .cse126 10))) (let ((.cse124 (div (+ .cse123 1) 5)) (.cse125 (div .cse126 50))) (and (= (mod .cse123 5) 0) (not (= (mod .cse124 29) 0)) (<= (mod .cse125 29) .cse8) (= (mod .cse126 10) 0) (not (= (mod (+ .cse124 1) 29) 0)) (< (+ .cse125 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse129 50)) (.cse127 (div .cse129 10))) (and (= (mod (div (+ .cse127 1) 5) 29) 0) (= (mod (+ .cse128 1) 29) 0) (<= (mod .cse128 29) .cse2) (not (< .cse127 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.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 ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse141 50))) (let ((.cse142 (mod .cse143 29))) (and (= (mod (div .cse141 10) 5) 0) (<= .cse142 .cse2) (= 0 .cse142) (= (mod .cse141 10) 0) (not (< (+ .cse143 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse145 50))) (and (<= (mod .cse144 29) .cse2) (<= 0 .cse144) (= (mod .cse145 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (+ (div .cse148 10) 1))) (let ((.cse146 (div .cse148 50)) (.cse150 (div .cse149 5))) (let ((.cse151 (mod (+ .cse150 1) 29)) (.cse147 (+ .cse146 1))) (and (not (= 0 (mod .cse146 29))) (not (= (mod .cse147 29) 0)) (not (= (mod .cse148 10) 0)) (not (= (mod .cse149 5) 0)) (not (= (mod .cse150 29) 0)) (<= .cse151 .cse8) (not (= .cse151 0)) (< .cse147 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse154 (div (+ (div .cse153 10) 1) 5))) (let ((.cse152 (mod .cse154 29))) (and (= .cse152 0) (= (mod (+ (div .cse153 50) 1) 29) 0) (not (= (mod .cse153 10) 0)) (< (+ .cse154 1) 0) (<= .cse152 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse155 (* 9 v_~a29~0_899))) (let ((.cse156 (div .cse155 50))) (and (= (mod (div .cse155 10) 5) 0) (<= (mod .cse156 29) .cse2) (<= 0 .cse156))))))) is different from true [2022-11-16 12:22:33,482 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 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 ((.cse6 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse6 50)) (.cse9 (+ (div .cse6 10) 1))) (let ((.cse7 (div .cse9 5)) (.cse5 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 29) 0)) (not (= (mod .cse6 10) 0)) (<= (mod .cse7 29) .cse8) (not (= (mod (+ .cse7 1) 29) 0)) (= (mod .cse9 5) 0) (< .cse5 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5))) (and (not (= (mod .cse10 10) 0)) (= (mod (+ .cse11 1) 29) 0) (<= (mod .cse11 29) .cse8) (= (mod .cse12 5) 0) (< (+ (div .cse10 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse15 (* 9 v_~a29~0_899))) (let ((.cse13 (div .cse15 10))) (let ((.cse14 (div (+ .cse13 1) 5))) (and (= (mod .cse13 5) 0) (= (mod .cse14 29) 0) (<= (mod (div .cse15 50) 29) .cse2) (= (mod .cse15 10) 0) (<= 0 (+ .cse14 1))))))) (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) (<= 0 (+ .cse17 1))))))) (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 ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse25 (div .cse27 50))) (let ((.cse24 (div (+ (div .cse27 10) 1) 5)) (.cse26 (+ .cse25 1))) (and (not (= (mod .cse24 29) 0)) (= 0 (mod .cse25 29)) (<= (mod .cse26 29) .cse8) (= (mod .cse27 10) 0) (not (= (mod (+ .cse24 1) 29) 0)) (< .cse26 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (div (* 9 v_~a29~0_899) 50))) (let ((.cse28 (mod .cse29 29))) (and (<= .cse28 .cse2) (= 0 .cse28) (not (< (+ .cse29 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse30 (div .cse32 50)) (.cse31 (div (+ (div .cse32 10) 1) 5))) (and (= (mod (+ .cse30 1) 29) 0) (<= (mod .cse30 29) .cse2) (= (mod (+ .cse31 1) 29) 0) (= (mod .cse32 10) 0) (not (< .cse31 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) (not (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (* 9 v_~a29~0_899))) (let ((.cse36 (div (+ (div .cse37 10) 1) 5))) (and (= (mod .cse36 29) 0) (<= (mod (div .cse37 50) 29) .cse2) (= (mod .cse37 10) 0) (<= 0 (+ .cse36 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse39 50))) (and (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (not (< (div .cse39 10) 0)) (= (mod .cse39 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 50)) (.cse40 (div .cse42 10))) (and (= (mod (div (+ .cse40 1) 5) 29) 0) (= (mod (+ .cse41 1) 29) 0) (<= (mod .cse41 29) .cse2) (not (< .cse40 0)) (= (mod .cse42 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse45 (div .cse43 50))) (let ((.cse44 (mod .cse45 29))) (and (= (mod (div (+ (div .cse43 10) 1) 5) 29) 0) (<= .cse44 .cse2) (= 0 .cse44) (not (< (+ .cse45 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse48 (div .cse46 5))) (let ((.cse47 (+ .cse48 1))) (and (not (= (mod .cse46 5) 0)) (not (< .cse47 0)) (< .cse48 0) (<= (mod .cse47 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse51 10))) (let ((.cse50 (div (+ .cse49 1) 5))) (and (= (mod .cse49 5) 0) (= (mod (+ .cse50 1) 29) 0) (<= (mod (div .cse51 50) 29) .cse8) (= (mod .cse51 10) 0) (< .cse50 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse52 (div (+ (div .cse53 10) 1) 5)) (.cse54 (div .cse53 50))) (and (= (mod .cse52 29) 0) (not (= (mod .cse53 10) 0)) (<= (mod (+ .cse52 1) 29) .cse8) (= 0 (mod .cse54 29)) (< (+ .cse54 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse57 50))) (let ((.cse58 (+ .cse55 1))) (let ((.cse56 (mod .cse58 29))) (and (not (= 0 (mod .cse55 29))) (not (= .cse56 0)) (= (mod (+ (div (+ (div .cse57 10) 1) 5) 1) 29) 0) (<= .cse56 .cse8) (= (mod .cse57 10) 0) (< .cse58 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse59 50))) (and (= (mod (div .cse59 10) 5) 0) (<= (mod .cse60 29) .cse2) (<= 0 .cse60) (= (mod .cse59 10) 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 1) 29) 0) (<= (mod .cse62 29) .cse2) (not (< .cse62 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (+ (div .cse63 10) 1)) (.cse65 (div .cse63 50))) (and (not (= (mod .cse63 10) 0)) (<= (mod (div .cse64 5) 29) .cse8) (= 0 (mod .cse65 29)) (= (mod .cse64 5) 0) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse67 50))) (and (<= (mod .cse66 29) .cse2) (= (mod (+ (div (+ (div .cse67 10) 1) 5) 1) 29) 0) (<= 0 .cse66))))) (exists ((v_~a29~0_899 Int)) (let ((.cse69 (* 9 v_~a29~0_899))) (let ((.cse68 (div .cse69 50))) (and (<= (mod .cse68 29) .cse2) (= (mod (+ (div (+ (div .cse69 10) 1) 5) 1) 29) 0) (<= 0 .cse68) (= (mod .cse69 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse72 (div (+ (div .cse70 10) 1) 5))) (let ((.cse71 (mod (+ .cse72 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (= .cse71 0) (< .cse72 0) (<= .cse71 .cse2)))))) (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 ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse79 (div .cse78 50))) (and (= (mod (div (+ (div .cse78 10) 1) 5) 29) 0) (<= (mod .cse79 29) .cse2) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse82 50)) (.cse81 (div (+ (div .cse82 10) 1) 5))) (and (not (= 0 (mod .cse80 29))) (not (= (mod (+ .cse80 1) 29) 0)) (= (mod .cse81 29) 0) (not (= (mod .cse82 10) 0)) (<= (mod (+ .cse81 1) 29) .cse8))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10)) (.cse89 (mod (+ (div .cse90 50) 1) 29))) (and (= (mod (div (+ .cse88 1) 5) 29) 0) (= .cse89 0) (= (mod .cse90 10) 0) (< .cse88 0) (<= .cse89 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (mod (div (+ (div .cse92 10) 1) 5) 29))) (and (= .cse91 0) (<= .cse91 .cse2) (< .cse92 0) (not (< (+ (div .cse92 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse93 29) .cse2) (<= 0 .cse93)))) (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 .cse8) (= (mod .cse105 10) 0) (not (= (mod (+ .cse104 1) 29) 0)) (< .cse106 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (let ((.cse109 (+ (div .cse108 10) 1))) (let ((.cse110 (div .cse109 5))) (let ((.cse111 (mod (+ .cse110 1) 29)) (.cse107 (div .cse108 50))) (and (not (= 0 (mod .cse107 29))) (not (= (mod .cse108 10) 0)) (not (= (mod .cse109 5) 0)) (not (= (mod .cse110 29) 0)) (<= .cse111 .cse8) (not (= .cse111 0)) (< (+ .cse107 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse115 50))) (let ((.cse112 (div .cse115 10)) (.cse114 (+ .cse113 1))) (and (= (mod (div (+ .cse112 1) 5) 29) 0) (not (= (mod .cse112 5) 0)) (= 0 (mod .cse113 29)) (<= (mod .cse114 29) .cse8) (= (mod .cse115 10) 0) (< .cse114 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (let ((.cse116 (mod .cse118 29))) (and (<= .cse116 .cse2) (= 0 .cse116) (= (mod .cse117 10) 0) (not (< (+ .cse118 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse120 (div .cse119 50))) (and (= (mod (div .cse119 10) 5) 0) (= (mod (+ .cse120 1) 29) 0) (<= (mod .cse120 29) .cse2) (not (< .cse120 0)) (= (mod .cse119 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5))) (let ((.cse121 (mod .cse122 29))) (and (= .cse121 0) (not (< (+ .cse122 1) 0)) (<= .cse121 .cse2) (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse125 (* 9 v_~a29~0_899))) (let ((.cse124 (div (+ (div .cse125 10) 1) 5))) (and (< .cse124 0) (<= (mod (+ .cse124 1) 29) .cse2) (not (< (+ (div .cse125 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse126 (div (+ (div .cse127 10) 1) 5))) (and (not (< (+ .cse126 1) 0)) (<= (mod .cse126 29) .cse8) (< (+ (div .cse127 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse131 10))) (let ((.cse129 (div (+ .cse128 1) 5)) (.cse130 (div .cse131 50))) (and (= (mod .cse128 5) 0) (not (= (mod .cse129 29) 0)) (<= (mod .cse130 29) .cse8) (= (mod .cse131 10) 0) (not (= (mod (+ .cse129 1) 29) 0)) (< (+ .cse130 1) 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 (div (+ .cse132 1) 5) 29) 0) (= (mod (+ .cse133 1) 29) 0) (<= (mod .cse133 29) .cse2) (not (< .cse132 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse136 10))) (let ((.cse137 (div (+ .cse135 1) 5))) (and (= (mod .cse135 5) 0) (<= (mod (div .cse136 50) 29) .cse2) (= (mod (+ .cse137 1) 29) 0) (= (mod .cse136 10) 0) (not (< .cse137 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse139 (div .cse140 50)) (.cse138 (div .cse140 10))) (and (= (mod .cse138 5) 0) (= (mod (+ .cse139 1) 29) 0) (<= (mod .cse139 29) .cse2) (not (< (div (+ .cse138 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse141 (div .cse143 10)) (.cse142 (div .cse143 50))) (and (= (mod .cse141 5) 0) (<= (mod .cse142 29) .cse2) (= (mod (+ (div (+ .cse141 1) 5) 1) 29) 0) (<= 0 .cse142) (= (mod .cse143 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (+ (div .cse145 10) 1))) (and (not (< .cse144 0)) (<= (mod (div .cse144 5) 29) .cse2) (< .cse145 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse146 50))) (let ((.cse147 (mod .cse148 29))) (and (= (mod (div .cse146 10) 5) 0) (<= .cse147 .cse2) (= 0 .cse147) (= (mod .cse146 10) 0) (not (< (+ .cse148 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse150 50))) (and (<= (mod .cse149 29) .cse2) (<= 0 .cse149) (= (mod .cse150 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse153 (div (+ (div .cse152 10) 1) 5))) (let ((.cse151 (mod .cse153 29))) (and (= .cse151 0) (= (mod (+ (div .cse152 50) 1) 29) 0) (not (= (mod .cse152 10) 0)) (< (+ .cse153 1) 0) (<= .cse151 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse155 (div .cse154 50))) (and (= (mod (div .cse154 10) 5) 0) (<= (mod .cse155 29) .cse2) (<= 0 .cse155))))))) is different from true [2022-11-16 12:23:09,893 WARN L855 $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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 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 ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse22 (+ (div .cse23 10) 1))) (and (<= (mod (div .cse22 5) 29) .cse2) (< .cse23 0) (= (mod .cse22 5) 0) (not (< (+ (div .cse23 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse24 50))) (let ((.cse25 (mod .cse26 29))) (and (= (mod (div (+ (div .cse24 10) 1) 5) 29) 0) (<= .cse25 .cse2) (= 0 .cse25) (= (mod .cse24 10) 0) (not (< (+ .cse26 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse30 50))) (let ((.cse27 (div (+ (div .cse30 10) 1) 5)) (.cse29 (+ .cse28 1))) (and (not (= (mod .cse27 29) 0)) (= 0 (mod .cse28 29)) (<= (mod .cse29 29) .cse6) (= (mod .cse30 10) 0) (not (= (mod (+ .cse27 1) 29) 0)) (< .cse29 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 ((.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 ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse84 (div .cse86 10)) (.cse85 (mod (+ (div .cse86 50) 1) 29))) (and (= (mod (div (+ .cse84 1) 5) 29) 0) (= .cse85 0) (= (mod .cse86 10) 0) (< .cse84 0) (<= .cse85 .cse2))))) (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 ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse105 (+ (div .cse104 10) 1))) (let ((.cse106 (div .cse105 5))) (let ((.cse107 (mod (+ .cse106 1) 29)) (.cse103 (div .cse104 50))) (and (not (= 0 (mod .cse103 29))) (not (= (mod .cse104 10) 0)) (not (= (mod .cse105 5) 0)) (not (= (mod .cse106 29) 0)) (<= .cse107 .cse6) (not (= .cse107 0)) (< (+ .cse103 1) 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))) (and (= (mod (div .cse115 10) 5) 0) (= (mod (+ .cse116 1) 29) 0) (<= (mod .cse116 29) .cse2) (not (< .cse116 0)) (= (mod .cse115 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (let ((.cse117 (mod .cse118 29))) (and (= .cse117 0) (not (< (+ .cse118 1) 0)) (<= .cse117 .cse2) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div (+ (div .cse121 10) 1) 5))) (and (< .cse120 0) (<= (mod (+ .cse120 1) 29) .cse2) (not (< (+ (div .cse121 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5))) (and (not (< (+ .cse122 1) 0)) (<= (mod .cse122 29) .cse6) (< (+ (div .cse123 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse127 (* 9 v_~a29~0_899))) (let ((.cse124 (div .cse127 10))) (let ((.cse125 (div (+ .cse124 1) 5)) (.cse126 (div .cse127 50))) (and (= (mod .cse124 5) 0) (not (= (mod .cse125 29) 0)) (<= (mod .cse126 29) .cse6) (= (mod .cse127 10) 0) (not (= (mod (+ .cse125 1) 29) 0)) (< (+ .cse126 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse130 50)) (.cse128 (div .cse130 10))) (and (= (mod (div (+ .cse128 1) 5) 29) 0) (= (mod (+ .cse129 1) 29) 0) (<= (mod .cse129 29) .cse2) (not (< .cse128 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse132 10))) (let ((.cse133 (div (+ .cse131 1) 5))) (and (= (mod .cse131 5) 0) (<= (mod (div .cse132 50) 29) .cse2) (= (mod (+ .cse133 1) 29) 0) (= (mod .cse132 10) 0) (not (< .cse133 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (div .cse136 50)) (.cse134 (div .cse136 10))) (and (= (mod .cse134 5) 0) (= (mod (+ .cse135 1) 29) 0) (<= (mod .cse135 29) .cse2) (not (< (div (+ .cse134 1) 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse139 10)) (.cse138 (div .cse139 50))) (and (= (mod .cse137 5) 0) (<= (mod .cse138 29) .cse2) (= (mod (+ (div (+ .cse137 1) 5) 1) 29) 0) (<= 0 .cse138) (= (mod .cse139 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (+ (div .cse141 10) 1))) (and (not (< .cse140 0)) (<= (mod (div .cse140 5) 29) .cse2) (< .cse141 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse142 50))) (let ((.cse143 (mod .cse144 29))) (and (= (mod (div .cse142 10) 5) 0) (<= .cse143 .cse2) (= 0 .cse143) (= (mod .cse142 10) 0) (not (< (+ .cse144 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse146 50))) (and (<= (mod .cse145 29) .cse2) (<= 0 .cse145) (= (mod .cse146 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (div (+ (div .cse148 10) 1) 5))) (let ((.cse147 (mod .cse149 29))) (and (= .cse147 0) (= (mod (+ (div .cse148 50) 1) 29) 0) (not (= (mod .cse148 10) 0)) (< (+ .cse149 1) 0) (<= .cse147 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse150 50))) (and (= (mod (div .cse150 10) 5) 0) (<= (mod .cse151 29) .cse2) (<= 0 .cse151))))))) is different from true [2022-11-16 12:24:24,056 WARN L855 $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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 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 ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse19 50))) (let ((.cse20 (+ .cse16 1))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 (mod .cse16 29))) (not (= .cse17 0)) (not (= (mod .cse18 5) 0)) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< .cse20 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (div (+ .cse21 1) 5))) (and (= (mod .cse21 5) 0) (= (mod .cse22 29) 0) (<= (mod (div .cse23 50) 29) .cse2) (= (mod .cse23 10) 0) (<= 0 (+ .cse22 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (div (+ .cse24 1) 5))) (and (= (mod .cse24 5) 0) (= (mod .cse25 29) 0) (<= (mod (div .cse26 50) 29) .cse2) (<= 0 (+ .cse25 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (+ (div .cse28 10) 1))) (and (<= (mod (div .cse27 5) 29) .cse2) (< .cse28 0) (= (mod .cse27 5) 0) (not (< (+ (div .cse28 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse29 50))) (let ((.cse30 (mod .cse31 29))) (and (= (mod (div (+ (div .cse29 10) 1) 5) 29) 0) (<= .cse30 .cse2) (= 0 .cse30) (= (mod .cse29 10) 0) (not (< (+ .cse31 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse33 (div .cse35 50))) (let ((.cse32 (div (+ (div .cse35 10) 1) 5)) (.cse34 (+ .cse33 1))) (and (not (= (mod .cse32 29) 0)) (= 0 (mod .cse33 29)) (<= (mod .cse34 29) .cse6) (= (mod .cse35 10) 0) (not (= (mod (+ .cse32 1) 29) 0)) (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (div (* 9 v_~a29~0_899) 50))) (let ((.cse36 (mod .cse37 29))) (and (<= .cse36 .cse2) (= 0 .cse36) (not (< (+ .cse37 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse40 50)) (.cse39 (div (+ (div .cse40 10) 1) 5))) (and (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (= (mod (+ .cse39 1) 29) 0) (= (mod .cse40 10) 0) (not (< .cse39 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse43 50)) (.cse42 (div (+ (div .cse43 10) 1) 5))) (and (= (mod (+ .cse41 1) 29) 0) (<= (mod .cse41 29) .cse2) (= (mod (+ .cse42 1) 29) 0) (not (< .cse42 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse44 (div (+ (div .cse45 10) 1) 5))) (and (= (mod .cse44 29) 0) (<= (mod (div .cse45 50) 29) .cse2) (= (mod .cse45 10) 0) (<= 0 (+ .cse44 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse47 50))) (and (= (mod (+ .cse46 1) 29) 0) (<= (mod .cse46 29) .cse2) (not (< (div .cse47 10) 0)) (= (mod .cse47 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse50 50)) (.cse48 (div .cse50 10))) (and (= (mod (div (+ .cse48 1) 5) 29) 0) (= (mod (+ .cse49 1) 29) 0) (<= (mod .cse49 29) .cse2) (not (< .cse48 0)) (= (mod .cse50 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (* 9 v_~a29~0_899))) (let ((.cse53 (div .cse51 50))) (let ((.cse52 (mod .cse53 29))) (and (= (mod (div (+ (div .cse51 10) 1) 5) 29) 0) (<= .cse52 .cse2) (= 0 .cse52) (not (< (+ .cse53 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse56 (div .cse54 5))) (let ((.cse55 (+ .cse56 1))) (and (not (= (mod .cse54 5) 0)) (not (< .cse55 0)) (< .cse56 0) (<= (mod .cse55 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse57 (div .cse59 10))) (let ((.cse58 (div (+ .cse57 1) 5))) (and (= (mod .cse57 5) 0) (= (mod (+ .cse58 1) 29) 0) (<= (mod (div .cse59 50) 29) .cse6) (= (mod .cse59 10) 0) (< .cse58 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse60 (div (+ (div .cse61 10) 1) 5)) (.cse62 (div .cse61 50))) (and (= (mod .cse60 29) 0) (not (= (mod .cse61 10) 0)) (<= (mod (+ .cse60 1) 29) .cse6) (= 0 (mod .cse62 29)) (< (+ .cse62 1) 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 29) .cse2) (<= 0 .cse64) (= (mod .cse63 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse65 (* 9 v_~a29~0_899))) (let ((.cse66 (div .cse65 50))) (and (= (mod (div .cse65 10) 5) 0) (= (mod (+ .cse66 1) 29) 0) (<= (mod .cse66 29) .cse2) (not (< .cse66 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse67 (* 9 v_~a29~0_899))) (let ((.cse68 (+ (div .cse67 10) 1)) (.cse69 (div .cse67 50))) (and (not (= (mod .cse67 10) 0)) (<= (mod (div .cse68 5) 29) .cse6) (= 0 (mod .cse69 29)) (= (mod .cse68 5) 0) (< (+ .cse69 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse71 (* 9 v_~a29~0_899))) (let ((.cse70 (div .cse71 50))) (and (<= (mod .cse70 29) .cse2) (= (mod (+ (div (+ (div .cse71 10) 1) 5) 1) 29) 0) (<= 0 .cse70))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse72 (div .cse73 50))) (and (<= (mod .cse72 29) .cse2) (= (mod (+ (div (+ (div .cse73 10) 1) 5) 1) 29) 0) (<= 0 .cse72) (= (mod .cse73 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse76 (div (+ (div .cse74 10) 1) 5))) (let ((.cse75 (mod (+ .cse76 1) 29))) (and (= (mod (+ (div .cse74 50) 1) 29) 0) (not (= (mod .cse74 10) 0)) (= .cse75 0) (< .cse76 0) (<= .cse75 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse78 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse78 50))) (and (= (mod (+ .cse77 1) 29) 0) (<= (mod .cse77 29) .cse2) (not (< (div .cse78 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse79 (div .cse81 10)) (.cse80 (div .cse81 50))) (and (= (mod .cse79 5) 0) (<= (mod .cse80 29) .cse2) (= (mod (+ (div (+ .cse79 1) 5) 1) 29) 0) (<= 0 .cse80))))) (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 ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse91 10)) (.cse90 (mod (+ (div .cse91 50) 1) 29))) (and (= (mod (div (+ .cse89 1) 5) 29) 0) (= .cse90 0) (= (mod .cse91 10) 0) (< .cse89 0) (<= .cse90 .cse2))))) (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 ((.cse103 (* 9 v_~a29~0_899))) (let ((.cse104 (+ (div .cse103 10) 1))) (let ((.cse105 (div .cse104 5))) (let ((.cse106 (mod (+ .cse105 1) 29)) (.cse102 (div .cse103 50))) (and (not (= 0 (mod .cse102 29))) (not (= (mod .cse103 10) 0)) (not (= (mod .cse104 5) 0)) (not (= (mod .cse105 29) 0)) (<= .cse106 .cse6) (not (= .cse106 0)) (< (+ .cse102 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse108 (div .cse110 50))) (let ((.cse107 (div .cse110 10)) (.cse109 (+ .cse108 1))) (and (= (mod (div (+ .cse107 1) 5) 29) 0) (not (= (mod .cse107 5) 0)) (= 0 (mod .cse108 29)) (<= (mod .cse109 29) .cse6) (= (mod .cse110 10) 0) (< .cse109 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (let ((.cse111 (mod .cse113 29))) (and (<= .cse111 .cse2) (= 0 .cse111) (= (mod .cse112 10) 0) (not (< (+ .cse113 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse114 50))) (and (= (mod (div .cse114 10) 5) 0) (= (mod (+ .cse115 1) 29) 0) (<= (mod .cse115 29) .cse2) (not (< .cse115 0)) (= (mod .cse114 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse117 (div (+ (div .cse118 10) 1) 5))) (let ((.cse116 (mod .cse117 29))) (and (= .cse116 0) (not (< (+ .cse117 1) 0)) (<= .cse116 .cse2) (< .cse118 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse119 (div (+ (div .cse120 10) 1) 5))) (and (< .cse119 0) (<= (mod (+ .cse119 1) 29) .cse2) (not (< (+ (div .cse120 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5))) (and (not (< (+ .cse121 1) 0)) (<= (mod .cse121 29) .cse6) (< (+ (div .cse122 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse123 (div .cse126 10))) (let ((.cse124 (div (+ .cse123 1) 5)) (.cse125 (div .cse126 50))) (and (= (mod .cse123 5) 0) (not (= (mod .cse124 29) 0)) (<= (mod .cse125 29) .cse6) (= (mod .cse126 10) 0) (not (= (mod (+ .cse124 1) 29) 0)) (< (+ .cse125 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse129 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse129 50)) (.cse127 (div .cse129 10))) (and (= (mod (div (+ .cse127 1) 5) 29) 0) (= (mod (+ .cse128 1) 29) 0) (<= (mod .cse128 29) .cse2) (not (< .cse127 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.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 ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse141 50))) (let ((.cse142 (mod .cse143 29))) (and (= (mod (div .cse141 10) 5) 0) (<= .cse142 .cse2) (= 0 .cse142) (= (mod .cse141 10) 0) (not (< (+ .cse143 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse145 50))) (and (<= (mod .cse144 29) .cse2) (<= 0 .cse144) (= (mod .cse145 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse148 (div (+ (div .cse147 10) 1) 5))) (let ((.cse146 (mod .cse148 29))) (and (= .cse146 0) (= (mod (+ (div .cse147 50) 1) 29) 0) (not (= (mod .cse147 10) 0)) (< (+ .cse148 1) 0) (<= .cse146 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse149 (* 9 v_~a29~0_899))) (let ((.cse150 (div .cse149 50))) (and (= (mod (div .cse149 10) 5) 0) (<= (mod .cse150 29) .cse2) (<= 0 .cse150))))))) is different from true