./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:52:02,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:52:02,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:52:02,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:52:02,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:52:02,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:52:02,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:52:02,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:52:02,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:52:02,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:52:02,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:52:02,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:52:02,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:52:02,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:52:02,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:52:02,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:52:02,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:52:02,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:52:02,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:52:02,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:52:02,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:52:02,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:52:02,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:52:02,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:52:02,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:52:02,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:52:02,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:52:02,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:52:02,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:52:02,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:52:02,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:52:02,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:52:02,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:52:02,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:52:02,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:52:02,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:52:02,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:52:02,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:52:02,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:52:02,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:52:02,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:52:02,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:52:02,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:52:02,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:52:02,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:52:02,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:52:02,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:52:02,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:52:02,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:52:02,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:52:02,211 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:52:02,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:52:02,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:52:02,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:52:02,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:52:02,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:52:02,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:52:02,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:52:02,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:52:02,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:52:02,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:52:02,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:52:02,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:52:02,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:52:02,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:52:02,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:52:02,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:52:02,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:52:02,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:52:02,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:52:02,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:52:02,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:52:02,220 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:52:02,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:52:02,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:52:02,222 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_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b72ce2b63fc45ad9e7a0a19d4e53676fd1965a82647477e906aa1505ccdd455f [2022-11-18 20:52:02,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:52:02,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:52:02,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:52:02,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:52:02,613 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:52:02,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-18 20:52:02,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/data/1eb4ac645/6547969bf75b476bbaed61dd56ce7de1/FLAG71c670a15 [2022-11-18 20:52:03,539 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:52:03,540 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-11-18 20:52:03,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/data/1eb4ac645/6547969bf75b476bbaed61dd56ce7de1/FLAG71c670a15 [2022-11-18 20:52:03,639 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/data/1eb4ac645/6547969bf75b476bbaed61dd56ce7de1 [2022-11-18 20:52:03,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:52:03,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:52:03,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:52:03,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:52:03,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:52:03,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:03" (1/1) ... [2022-11-18 20:52:03,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a368af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:03, skipping insertion in model container [2022-11-18 20:52:03,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:52:03" (1/1) ... [2022-11-18 20:52:03,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:52:03,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:52:04,182 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-18 20:52:04,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:52:04,823 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:52:04,870 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-11-18 20:52:05,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:52:05,194 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:52:05,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05 WrapperNode [2022-11-18 20:52:05,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:52:05,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:52:05,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:52:05,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:52:05,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,509 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-11-18 20:52:05,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:52:05,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:52:05,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:52:05,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:52:05,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:52:05,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:52:05,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:52:05,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:52:05,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (1/1) ... [2022-11-18 20:52:05,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:52:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:05,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:52:05,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:52:05,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:52:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:52:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:52:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:52:06,059 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:52:06,062 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:52:10,318 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:52:10,330 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:52:10,330 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:52:10,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:10 BoogieIcfgContainer [2022-11-18 20:52:10,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:52:10,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:52:10,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:52:10,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:52:10,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:52:03" (1/3) ... [2022-11-18 20:52:10,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2bcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:10, skipping insertion in model container [2022-11-18 20:52:10,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:52:05" (2/3) ... [2022-11-18 20:52:10,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2bcba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:52:10, skipping insertion in model container [2022-11-18 20:52:10,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:52:10" (3/3) ... [2022-11-18 20:52:10,343 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2022-11-18 20:52:10,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:52:10,365 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:52:10,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:52:10,441 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;@fb12ad3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:52:10,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:52:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:52:10,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:10,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:10,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2022-11-18 20:52:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847084966] [2022-11-18 20:52:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:10,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847084966] [2022-11-18 20:52:10,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847084966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:10,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:10,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54289464] [2022-11-18 20:52:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:10,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:11,035 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:13,843 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-11-18 20:52:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-18 20:52:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:13,865 INFO L225 Difference]: With dead ends: 1155 [2022-11-18 20:52:13,865 INFO L226 Difference]: Without dead ends: 667 [2022-11-18 20:52:13,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:13,874 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 287 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:13,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-18 20:52:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-18 20:52:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-11-18 20:52:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-11-18 20:52:13,987 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 57 [2022-11-18 20:52:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-11-18 20:52:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-11-18 20:52:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-18 20:52:13,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:13,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:52:13,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -664289441, now seen corresponding path program 1 times [2022-11-18 20:52:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389793376] [2022-11-18 20:52:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389793376] [2022-11-18 20:52:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389793376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:14,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52232839] [2022-11-18 20:52:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:14,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:14,263 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:17,400 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-11-18 20:52:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:17,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-11-18 20:52:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:17,411 INFO L225 Difference]: With dead ends: 1953 [2022-11-18 20:52:17,412 INFO L226 Difference]: Without dead ends: 1290 [2022-11-18 20:52:17,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:17,422 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-18 20:52:17,424 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-18 20:52:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-18 20:52:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-11-18 20:52:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-11-18 20:52:17,509 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 132 [2022-11-18 20:52:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:17,510 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-11-18 20:52:17,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-11-18 20:52:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-18 20:52:17,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:17,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:17,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:52:17,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 22508777, now seen corresponding path program 1 times [2022-11-18 20:52:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254167874] [2022-11-18 20:52:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254167874] [2022-11-18 20:52:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254167874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:17,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:17,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893448049] [2022-11-18 20:52:17,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:17,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:17,757 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:20,483 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-11-18 20:52:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-11-18 20:52:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:20,494 INFO L225 Difference]: With dead ends: 3764 [2022-11-18 20:52:20,494 INFO L226 Difference]: Without dead ends: 2484 [2022-11-18 20:52:20,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:20,506 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:20,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:52:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-11-18 20:52:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-11-18 20:52:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-11-18 20:52:20,586 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 136 [2022-11-18 20:52:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:20,587 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-11-18 20:52:20,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-11-18 20:52:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-18 20:52:20,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:20,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:20,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:52:20,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1359144620, now seen corresponding path program 1 times [2022-11-18 20:52:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147881628] [2022-11-18 20:52:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-18 20:52:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:21,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147881628] [2022-11-18 20:52:21,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147881628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:21,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:21,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049671378] [2022-11-18 20:52:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:21,119 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:23,261 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-11-18 20:52:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2022-11-18 20:52:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:23,277 INFO L225 Difference]: With dead ends: 6166 [2022-11-18 20:52:23,278 INFO L226 Difference]: Without dead ends: 3986 [2022-11-18 20:52:23,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:23,283 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.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:23,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 20:52:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-11-18 20:52:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-11-18 20:52:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-11-18 20:52:23,370 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 227 [2022-11-18 20:52:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:23,371 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-11-18 20:52:23,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-11-18 20:52:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-11-18 20:52:23,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:23,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:52:23,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash -764479700, now seen corresponding path program 1 times [2022-11-18 20:52:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:23,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812269180] [2022-11-18 20:52:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-18 20:52:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:24,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812269180] [2022-11-18 20:52:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812269180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:24,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:24,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499420425] [2022-11-18 20:52:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:24,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:24,402 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:26,752 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-11-18 20:52:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2022-11-18 20:52:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:26,768 INFO L225 Difference]: With dead ends: 7661 [2022-11-18 20:52:26,768 INFO L226 Difference]: Without dead ends: 3981 [2022-11-18 20:52:26,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:26,774 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-18 20:52:26,775 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-18 20:52:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-11-18 20:52:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-11-18 20:52:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-11-18 20:52:26,874 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 329 [2022-11-18 20:52:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-11-18 20:52:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-11-18 20:52:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-11-18 20:52:26,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:26,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:26,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:52:26,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1396325859, now seen corresponding path program 1 times [2022-11-18 20:52:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:26,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850172959] [2022-11-18 20:52:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 20:52:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850172959] [2022-11-18 20:52:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850172959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:27,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818816959] [2022-11-18 20:52:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:27,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:27,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:27,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:27,336 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:30,078 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-11-18 20:52:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2022-11-18 20:52:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:30,099 INFO L225 Difference]: With dead ends: 9465 [2022-11-18 20:52:30,099 INFO L226 Difference]: Without dead ends: 5785 [2022-11-18 20:52:30,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:30,105 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 259 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:30,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:52:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-11-18 20:52:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-11-18 20:52:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.1675890695261155) internal successors, (6751), 5782 states have internal predecessors, (6751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-11-18 20:52:30,230 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 344 [2022-11-18 20:52:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:30,231 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-11-18 20:52:30,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-11-18 20:52:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-18 20:52:30,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:30,240 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:30,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:52:30,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1074223962, now seen corresponding path program 1 times [2022-11-18 20:52:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:30,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889497009] [2022-11-18 20:52:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:52:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:30,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889497009] [2022-11-18 20:52:30,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889497009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:30,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:30,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118331487] [2022-11-18 20:52:30,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:30,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:30,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:30,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:30,839 INFO L87 Difference]: Start difference. First operand 5783 states and 6751 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:33,325 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-11-18 20:52:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2022-11-18 20:52:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:33,351 INFO L225 Difference]: With dead ends: 13364 [2022-11-18 20:52:33,351 INFO L226 Difference]: Without dead ends: 7882 [2022-11-18 20:52:33,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:33,359 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:33,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 20:52:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-11-18 20:52:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-11-18 20:52:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148702457778388) internal successors, (8366), 7283 states have internal predecessors, (8366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-11-18 20:52:33,510 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 403 [2022-11-18 20:52:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:33,511 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-11-18 20:52:33,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-11-18 20:52:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-11-18 20:52:33,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:33,521 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:33,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:52:33,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1496156917, now seen corresponding path program 1 times [2022-11-18 20:52:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:33,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285269288] [2022-11-18 20:52:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 20:52:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:34,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285269288] [2022-11-18 20:52:34,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285269288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:34,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:34,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167025703] [2022-11-18 20:52:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:34,054 INFO L87 Difference]: Start difference. First operand 7284 states and 8366 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:36,664 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-11-18 20:52:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 418 [2022-11-18 20:52:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:36,690 INFO L225 Difference]: With dead ends: 16069 [2022-11-18 20:52:36,690 INFO L226 Difference]: Without dead ends: 9086 [2022-11-18 20:52:36,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:36,699 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 272 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:36,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-18 20:52:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-11-18 20:52:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-11-18 20:52:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1379716981132075) internal successors, (9650), 8480 states have internal predecessors, (9650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-11-18 20:52:36,920 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 418 [2022-11-18 20:52:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:36,921 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-11-18 20:52:36,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-11-18 20:52:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2022-11-18 20:52:36,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:36,942 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:36,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:52:36,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1478191957, now seen corresponding path program 1 times [2022-11-18 20:52:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:36,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353282344] [2022-11-18 20:52:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:52:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:37,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353282344] [2022-11-18 20:52:37,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353282344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:37,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:37,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319707585] [2022-11-18 20:52:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:37,404 INFO L87 Difference]: Start difference. First operand 8481 states and 9650 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:39,845 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-11-18 20:52:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:39,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 508 [2022-11-18 20:52:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:39,873 INFO L225 Difference]: With dead ends: 19651 [2022-11-18 20:52:39,880 INFO L226 Difference]: Without dead ends: 11471 [2022-11-18 20:52:39,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:39,890 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:39,891 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.3s Time] [2022-11-18 20:52:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-11-18 20:52:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-11-18 20:52:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1486076283489508) internal successors, (8703), 7577 states have internal predecessors, (8703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-11-18 20:52:40,045 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 508 [2022-11-18 20:52:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:40,046 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-11-18 20:52:40,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-11-18 20:52:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-11-18 20:52:40,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:40,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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:40,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:52:40,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash -732988878, now seen corresponding path program 1 times [2022-11-18 20:52:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606564241] [2022-11-18 20:52:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 519 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-18 20:52:41,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:41,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606564241] [2022-11-18 20:52:41,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606564241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765219844] [2022-11-18 20:52:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:41,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:41,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:52:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:41,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:52:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-18 20:52:41,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:41,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765219844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:41,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:52:41,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 20:52:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319479320] [2022-11-18 20:52:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:41,702 INFO L87 Difference]: Start difference. First operand 7578 states and 8703 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:44,166 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-11-18 20:52:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2022-11-18 20:52:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:44,187 INFO L225 Difference]: With dead ends: 17246 [2022-11-18 20:52:44,187 INFO L226 Difference]: Without dead ends: 9969 [2022-11-18 20:52:44,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:44,194 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:44,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 20:52:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-11-18 20:52:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-11-18 20:52:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.1499799357945426) internal successors, (11463), 9968 states have internal predecessors, (11463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-11-18 20:52:44,364 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 541 [2022-11-18 20:52:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:44,366 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-11-18 20:52:44,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-11-18 20:52:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2022-11-18 20:52:44,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:44,374 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:44,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:52:44,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:44,580 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -93352388, now seen corresponding path program 1 times [2022-11-18 20:52:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575529566] [2022-11-18 20:52:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-18 20:52:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575529566] [2022-11-18 20:52:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575529566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:45,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:45,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:45,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667921601] [2022-11-18 20:52:45,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:45,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:45,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:45,509 INFO L87 Difference]: Start difference. First operand 9969 states and 11463 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:48,532 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-11-18 20:52:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 545 [2022-11-18 20:52:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:48,560 INFO L225 Difference]: With dead ends: 24136 [2022-11-18 20:52:48,561 INFO L226 Difference]: Without dead ends: 14468 [2022-11-18 20:52:48,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:48,571 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:48,571 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.9s Time] [2022-11-18 20:52:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-11-18 20:52:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-11-18 20:52:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1348449530267712) internal successors, (16066), 14157 states have internal predecessors, (16066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-11-18 20:52:48,792 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 545 [2022-11-18 20:52:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-11-18 20:52:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-11-18 20:52:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2022-11-18 20:52:48,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:48,806 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:48,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:52:48,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1966218800, now seen corresponding path program 1 times [2022-11-18 20:52:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240315511] [2022-11-18 20:52:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 676 proven. 39 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-11-18 20:52:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240315511] [2022-11-18 20:52:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240315511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671792770] [2022-11-18 20:52:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:49,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:49,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:52:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:50,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:52:50,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-11-18 20:52:50,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671792770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:52:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 20:52:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004024639] [2022-11-18 20:52:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:50,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:50,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:50,469 INFO L87 Difference]: Start difference. First operand 14158 states and 16066 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:52,956 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-11-18 20:52:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 620 [2022-11-18 20:52:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:52,981 INFO L225 Difference]: With dead ends: 27712 [2022-11-18 20:52:52,981 INFO L226 Difference]: Without dead ends: 13855 [2022-11-18 20:52:52,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:52,993 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-18 20:52:52,994 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-18 20:52:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-11-18 20:52:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-11-18 20:52:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-11-18 20:52:53,214 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 620 [2022-11-18 20:52:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:53,216 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-11-18 20:52:53,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-11-18 20:52:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2022-11-18 20:52:53,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:53,229 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:53,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:53,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:53,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:52:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1575532913, now seen corresponding path program 1 times [2022-11-18 20:52:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:53,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474639884] [2022-11-18 20:52:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-18 20:52:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474639884] [2022-11-18 20:52:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474639884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258121053] [2022-11-18 20:52:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:54,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:54,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:52:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:54,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:52:54,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-18 20:52:55,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:52:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-18 20:52:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258121053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:52:57,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:52:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-18 20:52:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025449949] [2022-11-18 20:52:57,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:52:57,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:52:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:52:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:52:57,110 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:06,257 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-11-18 20:53:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:53:06,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 621 [2022-11-18 20:53:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:06,284 INFO L225 Difference]: With dead ends: 35741 [2022-11-18 20:53:06,284 INFO L226 Difference]: Without dead ends: 16247 [2022-11-18 20:53:06,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1236 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-18 20:53:06,296 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2855 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5909 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 5909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:06,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 246 Invalid, 6570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 5909 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-18 20:53:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-11-18 20:53:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-11-18 20:53:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0386047264486888) internal successors, (12833), 12356 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-11-18 20:53:06,514 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 621 [2022-11-18 20:53:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:06,515 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-11-18 20:53:06,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-11-18 20:53:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2022-11-18 20:53:06,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:06,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:06,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:53:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:06,736 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1914023780, now seen corresponding path program 1 times [2022-11-18 20:53:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:06,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861003818] [2022-11-18 20:53:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-18 20:53:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861003818] [2022-11-18 20:53:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861003818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:53:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663448279] [2022-11-18 20:53:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:07,376 INFO L87 Difference]: Start difference. First operand 12357 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:08,772 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-11-18 20:53:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 658 [2022-11-18 20:53:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:08,791 INFO L225 Difference]: With dead ends: 28295 [2022-11-18 20:53:08,792 INFO L226 Difference]: Without dead ends: 15940 [2022-11-18 20:53:08,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-18 20:53:08,800 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 257 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:08,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-18 20:53:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-18 20:53:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-11-18 20:53:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15042 states have (on average 1.032974338518814) internal successors, (15538), 15042 states have internal predecessors, (15538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-11-18 20:53:09,023 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 658 [2022-11-18 20:53:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:09,024 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-11-18 20:53:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-11-18 20:53:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2022-11-18 20:53:09,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:09,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:09,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:53:09,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1275389892, now seen corresponding path program 1 times [2022-11-18 20:53:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:09,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677992385] [2022-11-18 20:53:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:09,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-11-18 20:53:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:09,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677992385] [2022-11-18 20:53:09,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677992385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:09,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:09,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:53:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922707497] [2022-11-18 20:53:09,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:09,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:53:09,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:09,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:53:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:53:09,786 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:11,954 INFO L93 Difference]: Finished difference Result 33973 states and 35169 transitions. [2022-11-18 20:53:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:53:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 682 [2022-11-18 20:53:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:11,976 INFO L225 Difference]: With dead ends: 33973 [2022-11-18 20:53:11,976 INFO L226 Difference]: Without dead ends: 18932 [2022-11-18 20:53:11,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:53:11,987 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 675 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 426 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 20:53:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2022-11-18 20:53:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18035. [2022-11-18 20:53:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18035 states, 18034 states have (on average 1.0311633581013642) internal successors, (18596), 18034 states have internal predecessors, (18596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 18596 transitions. [2022-11-18 20:53:12,370 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 18596 transitions. Word has length 682 [2022-11-18 20:53:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:12,372 INFO L495 AbstractCegarLoop]: Abstraction has 18035 states and 18596 transitions. [2022-11-18 20:53:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 18596 transitions. [2022-11-18 20:53:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2022-11-18 20:53:12,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:12,394 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:12,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:53:12,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:12,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -402468340, now seen corresponding path program 1 times [2022-11-18 20:53:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873741628] [2022-11-18 20:53:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-11-18 20:53:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873741628] [2022-11-18 20:53:13,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873741628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:13,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:53:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604086831] [2022-11-18 20:53:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:13,046 INFO L87 Difference]: Start difference. First operand 18035 states and 18596 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:14,416 INFO L93 Difference]: Finished difference Result 36065 states and 37196 transitions. [2022-11-18 20:53:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 713 [2022-11-18 20:53:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:14,435 INFO L225 Difference]: With dead ends: 36065 [2022-11-18 20:53:14,435 INFO L226 Difference]: Without dead ends: 18331 [2022-11-18 20:53:14,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:14,446 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:53:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2022-11-18 20:53:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18031. [2022-11-18 20:53:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 18030 states have (on average 1.031003882418192) internal successors, (18589), 18030 states have internal predecessors, (18589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 18589 transitions. [2022-11-18 20:53:14,771 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 18589 transitions. Word has length 713 [2022-11-18 20:53:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:14,772 INFO L495 AbstractCegarLoop]: Abstraction has 18031 states and 18589 transitions. [2022-11-18 20:53:14,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 18589 transitions. [2022-11-18 20:53:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2022-11-18 20:53:14,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:14,788 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:53:14,788 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1638431091, now seen corresponding path program 1 times [2022-11-18 20:53:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:14,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248113454] [2022-11-18 20:53:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-11-18 20:53:15,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:15,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248113454] [2022-11-18 20:53:15,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248113454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:15,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:15,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:53:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534958759] [2022-11-18 20:53:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:15,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:15,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:15,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:15,351 INFO L87 Difference]: Start difference. First operand 18031 states and 18589 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:16,830 INFO L93 Difference]: Finished difference Result 38449 states and 39675 transitions. [2022-11-18 20:53:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 784 [2022-11-18 20:53:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:16,857 INFO L225 Difference]: With dead ends: 38449 [2022-11-18 20:53:16,857 INFO L226 Difference]: Without dead ends: 20719 [2022-11-18 20:53:16,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:16,869 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:16,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 161 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-18 20:53:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2022-11-18 20:53:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 19523. [2022-11-18 20:53:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19523 states, 19522 states have (on average 1.0284806884540518) internal successors, (20078), 19522 states have internal predecessors, (20078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19523 states to 19523 states and 20078 transitions. [2022-11-18 20:53:17,185 INFO L78 Accepts]: Start accepts. Automaton has 19523 states and 20078 transitions. Word has length 784 [2022-11-18 20:53:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:17,186 INFO L495 AbstractCegarLoop]: Abstraction has 19523 states and 20078 transitions. [2022-11-18 20:53:17,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19523 states and 20078 transitions. [2022-11-18 20:53:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2022-11-18 20:53:17,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:17,200 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:17,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:53:17,201 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -523331930, now seen corresponding path program 1 times [2022-11-18 20:53:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:17,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020282790] [2022-11-18 20:53:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-11-18 20:53:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:17,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020282790] [2022-11-18 20:53:17,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020282790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:17,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:53:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991609224] [2022-11-18 20:53:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:17,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:17,762 INFO L87 Difference]: Start difference. First operand 19523 states and 20078 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:19,247 INFO L93 Difference]: Finished difference Result 41433 states and 42655 transitions. [2022-11-18 20:53:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 805 [2022-11-18 20:53:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:19,268 INFO L225 Difference]: With dead ends: 41433 [2022-11-18 20:53:19,268 INFO L226 Difference]: Without dead ends: 21912 [2022-11-18 20:53:19,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:19,278 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:19,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 460 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-18 20:53:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2022-11-18 20:53:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 17124. [2022-11-18 20:53:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17124 states, 17123 states have (on average 1.0263972434736903) internal successors, (17575), 17123 states have internal predecessors, (17575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 17575 transitions. [2022-11-18 20:53:19,600 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 17575 transitions. Word has length 805 [2022-11-18 20:53:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:19,600 INFO L495 AbstractCegarLoop]: Abstraction has 17124 states and 17575 transitions. [2022-11-18 20:53:19,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 17575 transitions. [2022-11-18 20:53:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-11-18 20:53:19,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:19,614 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:19,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:53:19,614 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1479206236, now seen corresponding path program 1 times [2022-11-18 20:53:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759395728] [2022-11-18 20:53:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-11-18 20:53:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759395728] [2022-11-18 20:53:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759395728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:20,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:53:20,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:53:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674424197] [2022-11-18 20:53:20,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:20,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:20,166 INFO L87 Difference]: Start difference. First operand 17124 states and 17575 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:21,517 INFO L93 Difference]: Finished difference Result 36039 states and 37016 transitions. [2022-11-18 20:53:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 842 [2022-11-18 20:53:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:21,534 INFO L225 Difference]: With dead ends: 36039 [2022-11-18 20:53:21,534 INFO L226 Difference]: Without dead ends: 19216 [2022-11-18 20:53:21,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:53:21,544 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 310 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:21,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:53:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2022-11-18 20:53:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 18020. [2022-11-18 20:53:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18020 states, 18019 states have (on average 1.0254176147399967) internal successors, (18477), 18019 states have internal predecessors, (18477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 18477 transitions. [2022-11-18 20:53:21,935 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 18477 transitions. Word has length 842 [2022-11-18 20:53:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:21,936 INFO L495 AbstractCegarLoop]: Abstraction has 18020 states and 18477 transitions. [2022-11-18 20:53:21,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 18477 transitions. [2022-11-18 20:53:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-11-18 20:53:21,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:21,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:53:21,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -537887034, now seen corresponding path program 1 times [2022-11-18 20:53:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:21,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416442091] [2022-11-18 20:53:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 629 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-18 20:53:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:24,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416442091] [2022-11-18 20:53:24,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416442091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:53:24,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288129509] [2022-11-18 20:53:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:24,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:24,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:24,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:53:24,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:53:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:24,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:53:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:53:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-11-18 20:53:24,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:53:24,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288129509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:53:24,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:53:24,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-18 20:53:24,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153113197] [2022-11-18 20:53:24,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:53:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:53:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:53:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:53:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:53:24,631 INFO L87 Difference]: Start difference. First operand 18020 states and 18477 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:53:26,344 INFO L93 Difference]: Finished difference Result 39939 states and 40943 transitions. [2022-11-18 20:53:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:53:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 863 [2022-11-18 20:53:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:53:26,362 INFO L225 Difference]: With dead ends: 39939 [2022-11-18 20:53:26,362 INFO L226 Difference]: Without dead ends: 21921 [2022-11-18 20:53:26,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 862 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:53:26,372 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 271 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:53:26,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 493 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-18 20:53:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2022-11-18 20:53:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 19818. [2022-11-18 20:53:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19818 states, 19817 states have (on average 1.025129938941313) internal successors, (20315), 19817 states have internal predecessors, (20315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20315 transitions. [2022-11-18 20:53:26,685 INFO L78 Accepts]: Start accepts. Automaton has 19818 states and 20315 transitions. Word has length 863 [2022-11-18 20:53:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:53:26,686 INFO L495 AbstractCegarLoop]: Abstraction has 19818 states and 20315 transitions. [2022-11-18 20:53:26,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:53:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19818 states and 20315 transitions. [2022-11-18 20:53:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-11-18 20:53:26,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:53:26,699 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:53:26,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:53:26,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:26,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:53:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:53:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 943867835, now seen corresponding path program 1 times [2022-11-18 20:53:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:53:26,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402742534] [2022-11-18 20:53:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:53:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 703 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-11-18 20:53:28,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:53:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402742534] [2022-11-18 20:53:28,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402742534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:53:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553701277] [2022-11-18 20:53:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:53:28,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:53:28,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:53:28,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:53:28,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72e1ca22-175b-4373-89c5-5e177c3b9e02/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:53:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:53:29,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:53:29,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:55:45,586 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:59:29,941 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 21:00:47,636 WARN L859 $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 ((.cse9 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse9 50)) (.cse5 (div .cse9 10))) (let ((.cse6 (div (+ .cse5 1) 5)) (.cse7 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 5) 0)) (not (= (mod .cse6 29) 0)) (<= (mod .cse7 29) .cse8) (= (mod .cse9 10) 0) (not (= (mod (+ .cse6 1) 29) 0)) (< .cse7 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 ((.cse21 (+ (div .cse20 10) 1))) (let ((.cse19 (div .cse21 5))) (and (= (mod .cse19 29) 0) (not (= (mod .cse20 10) 0)) (not (= (mod .cse21 5) 0)) (<= (mod (+ .cse19 1) 29) .cse8) (< (+ (div .cse20 50) 1) 0)))))) (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) .cse8) (= (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 ((.cse37 (* 9 v_~a29~0_899))) (let ((.cse36 (div .cse37 10))) (let ((.cse38 (div (+ .cse36 1) 5))) (and (= (mod .cse36 5) 0) (<= (mod (div .cse37 50) 29) .cse2) (= (mod (+ .cse38 1) 29) 0) (not (< .cse38 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse41 (* 9 v_~a29~0_899))) (let ((.cse39 (div .cse41 50)) (.cse40 (div (+ (div .cse41 10) 1) 5))) (and (= (mod (+ .cse39 1) 29) 0) (<= (mod .cse39 29) .cse2) (= (mod (+ .cse40 1) 29) 0) (not (< .cse40 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse43 (* 9 v_~a29~0_899))) (let ((.cse42 (div (+ (div .cse43 10) 1) 5))) (and (= (mod .cse42 29) 0) (<= (mod (div .cse43 50) 29) .cse2) (= (mod .cse43 10) 0) (<= 0 (+ .cse42 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse45 50))) (and (= (mod (+ .cse44 1) 29) 0) (<= (mod .cse44 29) .cse2) (not (< (div .cse45 10) 0)) (= (mod .cse45 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse47 (div .cse48 50)) (.cse46 (div .cse48 10))) (and (= (mod (div (+ .cse46 1) 5) 29) 0) (= (mod (+ .cse47 1) 29) 0) (<= (mod .cse47 29) .cse2) (not (< .cse46 0)) (= (mod .cse48 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse51 (div .cse49 50))) (let ((.cse50 (mod .cse51 29))) (and (= (mod (div (+ (div .cse49 10) 1) 5) 29) 0) (<= .cse50 .cse2) (= 0 .cse50) (not (< (+ .cse51 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse54 (div .cse52 5))) (let ((.cse53 (+ .cse54 1))) (and (not (= (mod .cse52 5) 0)) (not (< .cse53 0)) (< .cse54 0) (<= (mod .cse53 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse56 (* 9 v_~a29~0_899))) (let ((.cse58 (+ (div .cse56 10) 1))) (let ((.cse57 (div .cse58 5))) (let ((.cse55 (mod .cse57 29))) (and (= .cse55 0) (not (= (mod .cse56 10) 0)) (< (+ .cse57 1) 0) (<= .cse55 .cse2) (= (mod .cse58 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (and (not (= (mod .cse59 10) 0)) (= (mod (+ (div (+ (div .cse59 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse59 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse60 (div .cse62 10))) (let ((.cse61 (div (+ .cse60 1) 5))) (and (= (mod .cse60 5) 0) (= (mod (+ .cse61 1) 29) 0) (<= (mod (div .cse62 50) 29) .cse8) (= (mod .cse62 10) 0) (< .cse61 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) .cse8) (= 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 ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse73 (+ (div .cse72 10) 1))) (let ((.cse75 (div .cse73 5))) (let ((.cse74 (mod (+ .cse75 1) 29))) (and (= (mod (+ (div .cse72 50) 1) 29) 0) (not (= (mod .cse72 10) 0)) (not (= (mod .cse73 5) 0)) (= .cse74 0) (< .cse75 0) (<= .cse74 .cse2))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse76 (div .cse77 50))) (and (<= (mod .cse76 29) .cse2) (= (mod (+ (div (+ (div .cse77 10) 1) 5) 1) 29) 0) (<= 0 .cse76) (= (mod .cse77 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse79 50))) (and (= (mod (+ .cse78 1) 29) 0) (<= (mod .cse78 29) .cse2) (not (< (div .cse79 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse82 10)) (.cse81 (div .cse82 50))) (and (= (mod .cse80 5) 0) (<= (mod .cse81 29) .cse2) (= (mod (+ (div (+ .cse80 1) 5) 1) 29) 0) (<= 0 .cse81))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse83 (div .cse86 50)) (.cse87 (+ (div .cse86 10) 1))) (let ((.cse85 (div .cse87 5)) (.cse84 (+ .cse83 1))) (and (not (= 0 (mod .cse83 29))) (not (= (mod .cse84 29) 0)) (= (mod .cse85 29) 0) (not (= (mod .cse86 10) 0)) (not (= (mod .cse87 5) 0)) (<= (mod (+ .cse85 1) 29) .cse8) (< .cse84 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse89 (* 9 v_~a29~0_899))) (let ((.cse92 (+ (div .cse89 10) 1))) (let ((.cse91 (div .cse92 5))) (let ((.cse90 (mod .cse91 29)) (.cse88 (div .cse89 50))) (and (not (= 0 (mod .cse88 29))) (not (= (mod .cse89 10) 0)) (not (= .cse90 0)) (<= .cse90 .cse8) (not (= (mod (+ .cse91 1) 29) 0)) (= (mod .cse92 5) 0) (< (+ .cse88 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse94 (div .cse93 50))) (and (= (mod (div (+ (div .cse93 10) 1) 5) 29) 0) (<= (mod .cse94 29) .cse2) (<= 0 .cse94))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse97 (div .cse95 50))) (let ((.cse96 (mod .cse97 29))) (and (= (mod (div .cse95 10) 5) 0) (<= .cse96 .cse2) (= 0 .cse96) (not (< (+ .cse97 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse98 (div (+ (div .cse99 10) 1) 5))) (and (<= 0 .cse98) (<= (mod .cse98 29) .cse2) (< .cse99 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse100 (div .cse102 10)) (.cse101 (mod (+ (div .cse102 50) 1) 29))) (and (= (mod (div (+ .cse100 1) 5) 29) 0) (= .cse101 0) (= (mod .cse102 10) 0) (< .cse100 0) (<= .cse101 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse103 (mod (div (+ (div .cse104 10) 1) 5) 29))) (and (= .cse103 0) (<= .cse103 .cse2) (< .cse104 0) (not (< (+ (div .cse104 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse105 29) .cse2) (<= 0 .cse105)))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse106 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse106 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse110 50))) (let ((.cse111 (+ .cse107 1))) (let ((.cse109 (div .cse110 10)) (.cse108 (mod .cse111 29))) (and (not (= 0 (mod .cse107 29))) (not (= .cse108 0)) (not (= (mod .cse109 5) 0)) (= (mod (+ (div (+ .cse109 1) 5) 1) 29) 0) (<= .cse108 .cse8) (= (mod .cse110 10) 0) (< .cse111 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse114 10)) (.cse113 (div .cse114 50))) (and (= (mod .cse112 5) 0) (= (mod (div (+ .cse112 1) 5) 29) 0) (<= (mod .cse113 29) .cse2) (= (mod .cse114 10) 0) (< (+ .cse113 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse118 10))) (let ((.cse117 (div (+ .cse116 1) 5)) (.cse115 (mod (+ (div .cse118 50) 1) 29))) (and (= .cse115 0) (not (= (mod .cse116 5) 0)) (= (mod (+ .cse117 1) 29) 0) (= (mod .cse118 10) 0) (< .cse117 0) (<= .cse115 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse119 (+ (div .cse120 10) 1))) (and (= (mod (div .cse119 5) 29) 0) (= (mod (+ (div .cse120 50) 1) 29) 0) (not (= (mod .cse119 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse122 (div .cse124 50))) (let ((.cse121 (div .cse124 10)) (.cse123 (+ .cse122 1))) (and (= (mod (div (+ .cse121 1) 5) 29) 0) (not (= (mod .cse121 5) 0)) (= 0 (mod .cse122 29)) (<= (mod .cse123 29) .cse8) (= (mod .cse124 10) 0) (< .cse123 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse127 (div .cse126 50))) (let ((.cse125 (mod .cse127 29))) (and (<= .cse125 .cse2) (= 0 .cse125) (= (mod .cse126 10) 0) (not (< (+ .cse127 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse131 (* 9 v_~a29~0_899))) (let ((.cse128 (div .cse131 50))) (let ((.cse130 (div .cse131 10)) (.cse129 (mod (+ .cse128 1) 29))) (and (not (= 0 (mod .cse128 29))) (not (= .cse129 0)) (= (mod (div (+ .cse130 1) 5) 29) 0) (not (= (mod .cse130 5) 0)) (<= .cse129 .cse8) (= (mod .cse131 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse132 50))) (and (= (mod (div .cse132 10) 5) 0) (= (mod (+ .cse133 1) 29) 0) (<= (mod .cse133 29) .cse2) (not (< .cse133 0)) (= (mod .cse132 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse135 (div (+ (div .cse136 10) 1) 5))) (let ((.cse134 (mod .cse135 29))) (and (= .cse134 0) (not (< (+ .cse135 1) 0)) (<= .cse134 .cse2) (< .cse136 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse140 10))) (let ((.cse139 (div (+ .cse138 1) 5)) (.cse137 (mod (+ (div .cse140 50) 1) 29))) (and (= .cse137 0) (not (= (mod .cse138 5) 0)) (not (= (mod .cse139 29) 0)) (= (mod .cse140 10) 0) (not (= (mod (+ .cse139 1) 29) 0)) (< .cse138 0) (<= .cse137 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse141 (div (+ (div .cse142 10) 1) 5))) (and (< .cse141 0) (<= (mod (+ .cse141 1) 29) .cse2) (not (< (+ (div .cse142 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse143 (div (+ (div .cse144 10) 1) 5))) (and (not (< (+ .cse143 1) 0)) (<= (mod .cse143 29) .cse8) (< (+ (div .cse144 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse148 10))) (let ((.cse146 (div (+ .cse145 1) 5)) (.cse147 (div .cse148 50))) (and (= (mod .cse145 5) 0) (not (= (mod .cse146 29) 0)) (<= (mod .cse147 29) .cse8) (= (mod .cse148 10) 0) (not (= (mod (+ .cse146 1) 29) 0)) (< (+ .cse147 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse150 (div .cse151 50)) (.cse149 (div .cse151 10))) (and (= (mod (div (+ .cse149 1) 5) 29) 0) (= (mod (+ .cse150 1) 29) 0) (<= (mod .cse150 29) .cse2) (not (< .cse149 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse152 (div .cse153 10))) (let ((.cse154 (div (+ .cse152 1) 5))) (and (= (mod .cse152 5) 0) (<= (mod (div .cse153 50) 29) .cse2) (= (mod (+ .cse154 1) 29) 0) (= (mod .cse153 10) 0) (not (< .cse154 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse155 (div .cse157 10)) (.cse156 (div .cse157 50))) (and (= (mod .cse155 5) 0) (<= (mod .cse156 29) .cse2) (= (mod (+ (div (+ .cse155 1) 5) 1) 29) 0) (<= 0 .cse156) (= (mod .cse157 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse158 (* 9 v_~a29~0_899))) (let ((.cse159 (+ (div .cse158 10) 1))) (let ((.cse160 (mod (+ (div .cse159 5) 1) 29))) (and (not (= (mod (+ (div .cse158 50) 1) 29) 0)) (not (= (mod .cse158 10) 0)) (not (= (mod .cse159 5) 0)) (= .cse160 0) (<= .cse160 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse162 (* 9 v_~a29~0_899))) (let ((.cse161 (+ (div .cse162 10) 1))) (and (not (< .cse161 0)) (<= (mod (div .cse161 5) 29) .cse2) (< .cse162 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse163 (* 9 v_~a29~0_899))) (let ((.cse165 (div .cse163 50))) (let ((.cse164 (mod .cse165 29))) (and (= (mod (div .cse163 10) 5) 0) (<= .cse164 .cse2) (= 0 .cse164) (= (mod .cse163 10) 0) (not (< (+ .cse165 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse167 (* 9 v_~a29~0_899))) (let ((.cse166 (div .cse167 50))) (and (<= (mod .cse166 29) .cse2) (<= 0 .cse166) (= (mod .cse167 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse170 (* 9 v_~a29~0_899))) (let ((.cse171 (+ (div .cse170 10) 1))) (let ((.cse168 (div .cse170 50)) (.cse172 (div .cse171 5))) (let ((.cse173 (mod (+ .cse172 1) 29)) (.cse169 (+ .cse168 1))) (and (not (= 0 (mod .cse168 29))) (not (= (mod .cse169 29) 0)) (not (= (mod .cse170 10) 0)) (not (= (mod .cse171 5) 0)) (not (= (mod .cse172 29) 0)) (<= .cse173 .cse8) (not (= .cse173 0)) (< .cse169 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse174 (* 9 v_~a29~0_899))) (let ((.cse175 (div .cse174 50))) (and (= (mod (div .cse174 10) 5) 0) (<= (mod .cse175 29) .cse2) (<= 0 .cse175))))))) is different from true [2022-11-18 21:02:22,307 WARN L859 $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 ((.cse9 (* 9 v_~a29~0_899))) (let ((.cse4 (div .cse9 50)) (.cse5 (div .cse9 10))) (let ((.cse6 (div (+ .cse5 1) 5)) (.cse7 (+ .cse4 1))) (and (not (= 0 (mod .cse4 29))) (not (= (mod .cse5 5) 0)) (not (= (mod .cse6 29) 0)) (<= (mod .cse7 29) .cse8) (= (mod .cse9 10) 0) (not (= (mod (+ .cse6 1) 29) 0)) (< .cse7 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 ((.cse21 (+ (div .cse20 10) 1))) (let ((.cse19 (div .cse21 5))) (and (= (mod .cse19 29) 0) (not (= (mod .cse20 10) 0)) (not (= (mod .cse21 5) 0)) (<= (mod (+ .cse19 1) 29) .cse8) (< (+ (div .cse20 50) 1) 0)))))) (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 ((.cse28 (div (* 9 v_~a29~0_899) 50))) (let ((.cse27 (mod .cse28 29))) (and (<= .cse27 .cse2) (= 0 .cse27) (not (< (+ .cse28 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse31 50)) (.cse30 (div (+ (div .cse31 10) 1) 5))) (and (= (mod (+ .cse29 1) 29) 0) (<= (mod .cse29 29) .cse2) (= (mod (+ .cse30 1) 29) 0) (= (mod .cse31 10) 0) (not (< .cse30 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse33 10))) (let ((.cse34 (div (+ .cse32 1) 5))) (and (= (mod .cse32 5) 0) (<= (mod (div .cse33 50) 29) .cse2) (= (mod (+ .cse34 1) 29) 0) (not (< .cse34 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse37 50)) (.cse36 (div (+ (div .cse37 10) 1) 5))) (and (= (mod (+ .cse35 1) 29) 0) (<= (mod .cse35 29) .cse2) (= (mod (+ .cse36 1) 29) 0) (not (< .cse36 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse39 (* 9 v_~a29~0_899))) (let ((.cse38 (div (+ (div .cse39 10) 1) 5))) (and (= (mod .cse38 29) 0) (<= (mod (div .cse39 50) 29) .cse2) (= (mod .cse39 10) 0) (<= 0 (+ .cse38 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse41 (* 9 v_~a29~0_899))) (let ((.cse40 (div .cse41 50))) (and (= (mod (+ .cse40 1) 29) 0) (<= (mod .cse40 29) .cse2) (not (< (div .cse41 10) 0)) (= (mod .cse41 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse43 (div .cse44 50)) (.cse42 (div .cse44 10))) (and (= (mod (div (+ .cse42 1) 5) 29) 0) (= (mod (+ .cse43 1) 29) 0) (<= (mod .cse43 29) .cse2) (not (< .cse42 0)) (= (mod .cse44 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse45 (* 9 v_~a29~0_899))) (let ((.cse47 (div .cse45 50))) (let ((.cse46 (mod .cse47 29))) (and (= (mod (div (+ (div .cse45 10) 1) 5) 29) 0) (<= .cse46 .cse2) (= 0 .cse46) (not (< (+ .cse47 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse50 (div .cse48 5))) (let ((.cse49 (+ .cse50 1))) (and (not (= (mod .cse48 5) 0)) (not (< .cse49 0)) (< .cse50 0) (<= (mod .cse49 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse52 (* 9 v_~a29~0_899))) (let ((.cse54 (+ (div .cse52 10) 1))) (let ((.cse53 (div .cse54 5))) (let ((.cse51 (mod .cse53 29))) (and (= .cse51 0) (not (= (mod .cse52 10) 0)) (< (+ .cse53 1) 0) (<= .cse51 .cse2) (= (mod .cse54 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (* 9 v_~a29~0_899))) (let ((.cse55 (div .cse57 10))) (let ((.cse56 (div (+ .cse55 1) 5))) (and (= (mod .cse55 5) 0) (= (mod (+ .cse56 1) 29) 0) (<= (mod (div .cse57 50) 29) .cse8) (= (mod .cse57 10) 0) (< .cse56 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse60 50))) (let ((.cse61 (+ .cse58 1))) (let ((.cse59 (mod .cse61 29))) (and (not (= 0 (mod .cse58 29))) (not (= .cse59 0)) (= (mod (+ (div (+ (div .cse60 10) 1) 5) 1) 29) 0) (<= .cse59 .cse8) (= (mod .cse60 10) 0) (< .cse61 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse62 (* 9 v_~a29~0_899))) (let ((.cse63 (div .cse62 50))) (and (= (mod (div .cse62 10) 5) 0) (<= (mod .cse63 29) .cse2) (<= 0 .cse63) (= (mod .cse62 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse65 (div .cse64 50))) (and (= (mod (div .cse64 10) 5) 0) (= (mod (+ .cse65 1) 29) 0) (<= (mod .cse65 29) .cse2) (not (< .cse65 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse67 (+ (div .cse66 10) 1)) (.cse68 (div .cse66 50))) (and (not (= (mod .cse66 10) 0)) (<= (mod (div .cse67 5) 29) .cse8) (= 0 (mod .cse68 29)) (= (mod .cse67 5) 0) (< (+ .cse68 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse70 50))) (and (<= (mod .cse69 29) .cse2) (= (mod (+ (div (+ (div .cse70 10) 1) 5) 1) 29) 0) (<= 0 .cse69))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse71 (div .cse72 50))) (and (<= (mod .cse71 29) .cse2) (= (mod (+ (div (+ (div .cse72 10) 1) 5) 1) 29) 0) (<= 0 .cse71) (= (mod .cse72 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse73 (* 9 v_~a29~0_899))) (let ((.cse75 (div (+ (div .cse73 10) 1) 5))) (let ((.cse74 (mod (+ .cse75 1) 29))) (and (= (mod (+ (div .cse73 50) 1) 29) 0) (not (= (mod .cse73 10) 0)) (= .cse74 0) (< .cse75 0) (<= .cse74 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse76 (div .cse77 50))) (and (= (mod (+ .cse76 1) 29) 0) (<= (mod .cse76 29) .cse2) (not (< (div .cse77 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse80 (* 9 v_~a29~0_899))) (let ((.cse78 (div .cse80 10)) (.cse79 (div .cse80 50))) (and (= (mod .cse78 5) 0) (<= (mod .cse79 29) .cse2) (= (mod (+ (div (+ .cse78 1) 5) 1) 29) 0) (<= 0 .cse79))))) (exists ((v_~a29~0_899 Int)) (let ((.cse82 (* 9 v_~a29~0_899))) (let ((.cse85 (+ (div .cse82 10) 1))) (let ((.cse84 (div .cse85 5))) (let ((.cse83 (mod .cse84 29)) (.cse81 (div .cse82 50))) (and (not (= 0 (mod .cse81 29))) (not (= (mod .cse82 10) 0)) (not (= .cse83 0)) (<= .cse83 .cse8) (not (= (mod (+ .cse84 1) 29) 0)) (= (mod .cse85 5) 0) (< (+ .cse81 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse87 (div .cse86 50))) (and (= (mod (div (+ (div .cse86 10) 1) 5) 29) 0) (<= (mod .cse87 29) .cse2) (<= 0 .cse87))))) (exists ((v_~a29~0_899 Int)) (let ((.cse88 (* 9 v_~a29~0_899))) (let ((.cse90 (div .cse88 50))) (let ((.cse89 (mod .cse90 29))) (and (= (mod (div .cse88 10) 5) 0) (<= .cse89 .cse2) (= 0 .cse89) (not (< (+ .cse90 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (div (+ (div .cse92 10) 1) 5))) (and (<= 0 .cse91) (<= (mod .cse91 29) .cse2) (< .cse92 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse93 (div .cse95 10)) (.cse94 (mod (+ (div .cse95 50) 1) 29))) (and (= (mod (div (+ .cse93 1) 5) 29) 0) (= .cse94 0) (= (mod .cse95 10) 0) (< .cse93 0) (<= .cse94 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse96 (mod (div (+ (div .cse97 10) 1) 5) 29))) (and (= .cse96 0) (<= .cse96 .cse2) (< .cse97 0) (not (< (+ (div .cse97 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse101 50))) (let ((.cse100 (div .cse101 10)) (.cse99 (mod (+ .cse98 1) 29))) (and (not (= 0 (mod .cse98 29))) (not (= .cse99 0)) (= (mod (div (+ .cse100 1) 5) 29) 0) (not (= (mod .cse100 5) 0)) (<= .cse99 .cse8)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse102 29) .cse2) (<= 0 .cse102)))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse105 10)) (.cse104 (div .cse105 50))) (and (= (mod .cse103 5) 0) (= (mod (div (+ .cse103 1) 5) 29) 0) (<= (mod .cse104 29) .cse2) (= (mod .cse105 10) 0) (< (+ .cse104 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse109 10))) (let ((.cse108 (div (+ .cse107 1) 5)) (.cse106 (mod (+ (div .cse109 50) 1) 29))) (and (= .cse106 0) (not (= (mod .cse107 5) 0)) (= (mod (+ .cse108 1) 29) 0) (= (mod .cse109 10) 0) (< .cse108 0) (<= .cse106 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse113 50))) (let ((.cse110 (div .cse113 10)) (.cse112 (+ .cse111 1))) (and (= (mod (div (+ .cse110 1) 5) 29) 0) (not (= (mod .cse110 5) 0)) (= 0 (mod .cse111 29)) (<= (mod .cse112 29) .cse8) (= (mod .cse113 10) 0) (< .cse112 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (let ((.cse114 (mod .cse116 29))) (and (<= .cse114 .cse2) (= 0 .cse114) (= (mod .cse115 10) 0) (not (< (+ .cse116 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (let ((.cse119 (+ .cse118 1))) (and (not (= (mod (div (+ (div .cse117 10) 1) 5) 29) 0)) (= 0 (mod .cse118 29)) (<= (mod .cse119 29) .cse8) (= (mod .cse117 10) 0) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse120 50))) (and (= (mod (div .cse120 10) 5) 0) (= (mod (+ .cse121 1) 29) 0) (<= (mod .cse121 29) .cse2) (not (< .cse121 0)) (= (mod .cse120 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (let ((.cse122 (mod .cse123 29))) (and (= .cse122 0) (not (< (+ .cse123 1) 0)) (<= .cse122 .cse2) (< .cse124 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (< .cse125 0) (<= (mod (+ .cse125 1) 29) .cse2) (not (< (+ (div .cse126 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div (+ (div .cse128 10) 1) 5))) (and (not (< (+ .cse127 1) 0)) (<= (mod .cse127 29) .cse8) (< (+ (div .cse128 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse132 50))) (let ((.cse131 (div (+ (div .cse132 10) 1) 5)) (.cse130 (+ .cse129 1))) (and (not (= 0 (mod .cse129 29))) (not (= (mod .cse130 29) 0)) (= (mod .cse131 29) 0) (not (= (mod .cse132 10) 0)) (<= (mod (+ .cse131 1) 29) .cse8) (< .cse130 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse136 (* 9 v_~a29~0_899))) (let ((.cse133 (div .cse136 10))) (let ((.cse134 (div (+ .cse133 1) 5)) (.cse135 (div .cse136 50))) (and (= (mod .cse133 5) 0) (not (= (mod .cse134 29) 0)) (<= (mod .cse135 29) .cse8) (= (mod .cse136 10) 0) (not (= (mod (+ .cse134 1) 29) 0)) (< (+ .cse135 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse139 50)) (.cse137 (div .cse139 10))) (and (= (mod (div (+ .cse137 1) 5) 29) 0) (= (mod (+ .cse138 1) 29) 0) (<= (mod .cse138 29) .cse2) (not (< .cse137 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (div .cse141 10))) (let ((.cse142 (div (+ .cse140 1) 5))) (and (= (mod .cse140 5) 0) (<= (mod (div .cse141 50) 29) .cse2) (= (mod (+ .cse142 1) 29) 0) (= (mod .cse141 10) 0) (not (< .cse142 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse143 (div .cse145 10)) (.cse144 (div .cse145 50))) (and (= (mod .cse143 5) 0) (<= (mod .cse144 29) .cse2) (= (mod (+ (div (+ .cse143 1) 5) 1) 29) 0) (<= 0 .cse144) (= (mod .cse145 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse146 (+ (div .cse147 10) 1))) (and (not (< .cse146 0)) (<= (mod (div .cse146 5) 29) .cse2) (< .cse147 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse150 (div .cse148 50))) (let ((.cse149 (mod .cse150 29))) (and (= (mod (div .cse148 10) 5) 0) (<= .cse149 .cse2) (= 0 .cse149) (= (mod .cse148 10) 0) (not (< (+ .cse150 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse152 (* 9 v_~a29~0_899))) (let ((.cse151 (div .cse152 50))) (and (<= (mod .cse151 29) .cse2) (<= 0 .cse151) (= (mod .cse152 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse155 (* 9 v_~a29~0_899))) (let ((.cse156 (+ (div .cse155 10) 1))) (let ((.cse153 (div .cse155 50)) (.cse157 (div .cse156 5))) (let ((.cse158 (mod (+ .cse157 1) 29)) (.cse154 (+ .cse153 1))) (and (not (= 0 (mod .cse153 29))) (not (= (mod .cse154 29) 0)) (not (= (mod .cse155 10) 0)) (not (= (mod .cse156 5) 0)) (not (= (mod .cse157 29) 0)) (<= .cse158 .cse8) (not (= .cse158 0)) (< .cse154 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse159 (* 9 v_~a29~0_899))) (let ((.cse160 (div .cse159 50))) (and (= (mod (div .cse159 10) 5) 0) (<= (mod .cse160 29) .cse2) (<= 0 .cse160))))))) is different from true [2022-11-18 21:03:01,753 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse12 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse12 50)) (.cse9 (div .cse12 10))) (let ((.cse10 (div (+ .cse9 1) 5)) (.cse11 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 5) 0)) (not (= (mod .cse10 29) 0)) (<= (mod .cse11 29) .cse6) (= (mod .cse12 10) 0) (not (= (mod (+ .cse10 1) 29) 0)) (< .cse11 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (= (mod .cse18 10) 0) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (div (+ .cse19 1) 5))) (and (= (mod .cse19 5) 0) (= (mod .cse20 29) 0) (<= (mod (div .cse21 50) 29) .cse2) (<= 0 (+ .cse20 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse24 (+ (div .cse23 10) 1))) (let ((.cse22 (div .cse24 5))) (and (= (mod .cse22 29) 0) (not (= (mod .cse23 10) 0)) (not (= (mod .cse24 5) 0)) (<= (mod (+ .cse22 1) 29) .cse6) (< (+ (div .cse23 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse25 (+ (div .cse26 10) 1))) (and (<= (mod (div .cse25 5) 29) .cse2) (< .cse26 0) (= (mod .cse25 5) 0) (not (< (+ (div .cse26 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse27 50))) (let ((.cse28 (mod .cse29 29))) (and (= (mod (div (+ (div .cse27 10) 1) 5) 29) 0) (<= .cse28 .cse2) (= 0 .cse28) (= (mod .cse27 10) 0) (not (< (+ .cse29 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (div (* 9 v_~a29~0_899) 50))) (let ((.cse30 (mod .cse31 29))) (and (<= .cse30 .cse2) (= 0 .cse30) (not (< (+ .cse31 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse34 50)) (.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod (+ .cse32 1) 29) 0) (<= (mod .cse32 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (= (mod .cse34 10) 0) (not (< .cse33 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse36 10))) (let ((.cse37 (div (+ .cse35 1) 5))) (and (= (mod .cse35 5) 0) (<= (mod (div .cse36 50) 29) .cse2) (= (mod (+ .cse37 1) 29) 0) (not (< .cse37 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) (not (< .cse39 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div (+ (div .cse42 10) 1) 5))) (and (= (mod .cse41 29) 0) (<= (mod (div .cse42 50) 29) .cse2) (= (mod .cse42 10) 0) (<= 0 (+ .cse41 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse43 (div .cse44 50))) (and (= (mod (+ .cse43 1) 29) 0) (<= (mod .cse43 29) .cse2) (not (< (div .cse44 10) 0)) (= (mod .cse44 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse47 50)) (.cse45 (div .cse47 10))) (and (= (mod (div (+ .cse45 1) 5) 29) 0) (= (mod (+ .cse46 1) 29) 0) (<= (mod .cse46 29) .cse2) (not (< .cse45 0)) (= (mod .cse47 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse50 (div .cse48 50))) (let ((.cse49 (mod .cse50 29))) (and (= (mod (div (+ (div .cse48 10) 1) 5) 29) 0) (<= .cse49 .cse2) (= 0 .cse49) (not (< (+ .cse50 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse53 (div .cse51 5))) (let ((.cse52 (+ .cse53 1))) (and (not (= (mod .cse51 5) 0)) (not (< .cse52 0)) (< .cse53 0) (<= (mod .cse52 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse57 (+ (div .cse55 10) 1))) (let ((.cse56 (div .cse57 5))) (let ((.cse54 (mod .cse56 29))) (and (= .cse54 0) (not (= (mod .cse55 10) 0)) (< (+ .cse56 1) 0) (<= .cse54 .cse2) (= (mod .cse57 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse60 10))) (let ((.cse59 (div (+ .cse58 1) 5))) (and (= (mod .cse58 5) 0) (= (mod (+ .cse59 1) 29) 0) (<= (mod (div .cse60 50) 29) .cse6) (= (mod .cse60 10) 0) (< .cse59 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse61 50))) (and (= (mod (div .cse61 10) 5) 0) (<= (mod .cse62 29) .cse2) (<= 0 .cse62) (= (mod .cse61 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (div .cse63 50))) (and (= (mod (div .cse63 10) 5) 0) (= (mod (+ .cse64 1) 29) 0) (<= (mod .cse64 29) .cse2) (not (< .cse64 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse65 (* 9 v_~a29~0_899))) (let ((.cse66 (+ (div .cse65 10) 1)) (.cse67 (div .cse65 50))) (and (not (= (mod .cse65 10) 0)) (<= (mod (div .cse66 5) 29) .cse6) (= 0 (mod .cse67 29)) (= (mod .cse66 5) 0) (< (+ .cse67 1) 0))))) (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))))) (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) (= (mod .cse71 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse74 (div (+ (div .cse72 10) 1) 5))) (let ((.cse73 (mod (+ .cse74 1) 29))) (and (= (mod (+ (div .cse72 50) 1) 29) 0) (not (= (mod .cse72 10) 0)) (= .cse73 0) (< .cse74 0) (<= .cse73 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (= (mod (+ .cse75 1) 29) 0) (<= (mod .cse75 29) .cse2) (not (< (div .cse76 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse79 10)) (.cse78 (div .cse79 50))) (and (= (mod .cse77 5) 0) (<= (mod .cse78 29) .cse2) (= (mod (+ (div (+ .cse77 1) 5) 1) 29) 0) (<= 0 .cse78))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse84 (+ (div .cse81 10) 1))) (let ((.cse83 (div .cse84 5))) (let ((.cse82 (mod .cse83 29)) (.cse80 (div .cse81 50))) (and (not (= 0 (mod .cse80 29))) (not (= (mod .cse81 10) 0)) (not (= .cse82 0)) (<= .cse82 .cse6) (not (= (mod (+ .cse83 1) 29) 0)) (= (mod .cse84 5) 0) (< (+ .cse80 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse85 50))) (and (= (mod (div (+ (div .cse85 10) 1) 5) 29) 0) (<= (mod .cse86 29) .cse2) (<= 0 .cse86))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse87 50))) (let ((.cse88 (mod .cse89 29))) (and (= (mod (div .cse87 10) 5) 0) (<= .cse88 .cse2) (= 0 .cse88) (not (< (+ .cse89 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse90 (div (+ (div .cse91 10) 1) 5))) (and (<= 0 .cse90) (<= (mod .cse90 29) .cse2) (< .cse91 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse94 10)) (.cse93 (mod (+ (div .cse94 50) 1) 29))) (and (= (mod (div (+ .cse92 1) 5) 29) 0) (= .cse93 0) (= (mod .cse94 10) 0) (< .cse92 0) (<= .cse93 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse95 (mod (div (+ (div .cse96 10) 1) 5) 29))) (and (= .cse95 0) (<= .cse95 .cse2) (< .cse96 0) (not (< (+ (div .cse96 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse97 29) .cse2) (<= 0 .cse97)))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse100 10)) (.cse99 (div .cse100 50))) (and (= (mod .cse98 5) 0) (= (mod (div (+ .cse98 1) 5) 29) 0) (<= (mod .cse99 29) .cse2) (= (mod .cse100 10) 0) (< (+ .cse99 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse104 10))) (let ((.cse103 (div (+ .cse102 1) 5)) (.cse101 (mod (+ (div .cse104 50) 1) 29))) (and (= .cse101 0) (not (= (mod .cse102 5) 0)) (= (mod (+ .cse103 1) 29) 0) (= (mod .cse104 10) 0) (< .cse103 0) (<= .cse101 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse107 (* 9 v_~a29~0_899))) (let ((.cse105 (div .cse107 50)) (.cse108 (+ (div .cse107 10) 1))) (let ((.cse109 (mod (+ (div .cse108 5) 1) 29)) (.cse106 (+ .cse105 1))) (and (not (= 0 (mod .cse105 29))) (not (= (mod .cse106 29) 0)) (not (= (mod .cse107 10) 0)) (not (= (mod .cse108 5) 0)) (<= .cse109 .cse6) (not (= .cse109 0)) (< .cse106 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse113 50))) (let ((.cse110 (div .cse113 10)) (.cse112 (+ .cse111 1))) (and (= (mod (div (+ .cse110 1) 5) 29) 0) (not (= (mod .cse110 5) 0)) (= 0 (mod .cse111 29)) (<= (mod .cse112 29) .cse6) (= (mod .cse113 10) 0) (< .cse112 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (let ((.cse114 (mod .cse116 29))) (and (<= .cse114 .cse2) (= 0 .cse114) (= (mod .cse115 10) 0) (not (< (+ .cse116 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (let ((.cse119 (+ .cse118 1))) (and (not (= (mod (div (+ (div .cse117 10) 1) 5) 29) 0)) (= 0 (mod .cse118 29)) (<= (mod .cse119 29) .cse6) (= (mod .cse117 10) 0) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse121 (div .cse120 50))) (and (= (mod (div .cse120 10) 5) 0) (= (mod (+ .cse121 1) 29) 0) (<= (mod .cse121 29) .cse2) (not (< .cse121 0)) (= (mod .cse120 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse123 (div (+ (div .cse124 10) 1) 5))) (let ((.cse122 (mod .cse123 29))) (and (= .cse122 0) (not (< (+ .cse123 1) 0)) (<= .cse122 .cse2) (< .cse124 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (< .cse125 0) (<= (mod (+ .cse125 1) 29) .cse2) (not (< (+ (div .cse126 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div (+ (div .cse128 10) 1) 5))) (and (not (< (+ .cse127 1) 0)) (<= (mod .cse127 29) .cse6) (< (+ (div .cse128 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse132 10))) (let ((.cse130 (div (+ .cse129 1) 5)) (.cse131 (div .cse132 50))) (and (= (mod .cse129 5) 0) (not (= (mod .cse130 29) 0)) (<= (mod .cse131 29) .cse6) (= (mod .cse132 10) 0) (not (= (mod (+ .cse130 1) 29) 0)) (< (+ .cse131 1) 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 (div (+ .cse133 1) 5) 29) 0) (= (mod (+ .cse134 1) 29) 0) (<= (mod .cse134 29) .cse2) (not (< .cse133 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 10))) (let ((.cse138 (div (+ .cse136 1) 5))) (and (= (mod .cse136 5) 0) (<= (mod (div .cse137 50) 29) .cse2) (= (mod (+ .cse138 1) 29) 0) (= (mod .cse137 10) 0) (not (< .cse138 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse139 (div .cse141 10)) (.cse140 (div .cse141 50))) (and (= (mod .cse139 5) 0) (<= (mod .cse140 29) .cse2) (= (mod (+ (div (+ .cse139 1) 5) 1) 29) 0) (<= 0 .cse140) (= (mod .cse141 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (+ (div .cse143 10) 1))) (and (not (< .cse142 0)) (<= (mod (div .cse142 5) 29) .cse2) (< .cse143 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse144 50))) (let ((.cse145 (mod .cse146 29))) (and (= (mod (div .cse144 10) 5) 0) (<= .cse145 .cse2) (= 0 .cse145) (= (mod .cse144 10) 0) (not (< (+ .cse146 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse147 (div .cse148 50))) (and (<= (mod .cse147 29) .cse2) (<= 0 .cse147) (= (mod .cse148 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.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 [2022-11-18 21:06:26,148 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 42 c_~a29~0)) (.cse2 (+ c_~a29~0 13))) (or (exists ((v_~a29~0_899 Int)) (let ((.cse0 (* 9 v_~a29~0_899))) (let ((.cse3 (+ (div .cse0 10) 1))) (let ((.cse1 (div .cse3 5))) (and (= (mod (+ (div .cse0 50) 1) 29) 0) (not (< (+ .cse1 1) 0)) (<= (mod .cse1 29) .cse2) (< .cse0 0) (= (mod .cse3 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse5 (* 9 v_~a29~0_899))) (let ((.cse7 (+ (div .cse5 50) 1))) (let ((.cse4 (mod .cse7 29))) (and (not (= .cse4 0)) (= (mod (+ (div (+ (div .cse5 10) 1) 5) 1) 29) 0) (<= .cse4 .cse6) (= (mod .cse5 10) 0) (< .cse7 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse12 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse12 50)) (.cse9 (div .cse12 10))) (let ((.cse10 (div (+ .cse9 1) 5)) (.cse11 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 5) 0)) (not (= (mod .cse10 29) 0)) (<= (mod .cse11 29) .cse6) (= (mod .cse12 10) 0) (not (= (mod (+ .cse10 1) 29) 0)) (< .cse11 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (= (mod .cse18 10) 0) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (div (+ .cse19 1) 5))) (and (= (mod .cse19 5) 0) (= (mod .cse20 29) 0) (<= (mod (div .cse21 50) 29) .cse2) (<= 0 (+ .cse20 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse24 (+ (div .cse23 10) 1))) (let ((.cse22 (div .cse24 5))) (and (= (mod .cse22 29) 0) (not (= (mod .cse23 10) 0)) (not (= (mod .cse24 5) 0)) (<= (mod (+ .cse22 1) 29) .cse6) (< (+ (div .cse23 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse25 (+ (div .cse26 10) 1))) (and (<= (mod (div .cse25 5) 29) .cse2) (< .cse26 0) (= (mod .cse25 5) 0) (not (< (+ (div .cse26 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse27 (* 9 v_~a29~0_899))) (let ((.cse29 (div .cse27 50))) (let ((.cse28 (mod .cse29 29))) (and (= (mod (div (+ (div .cse27 10) 1) 5) 29) 0) (<= .cse28 .cse2) (= 0 .cse28) (= (mod .cse27 10) 0) (not (< (+ .cse29 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse31 (div (* 9 v_~a29~0_899) 50))) (let ((.cse30 (mod .cse31 29))) (and (<= .cse30 .cse2) (= 0 .cse30) (not (< (+ .cse31 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse34 (* 9 v_~a29~0_899))) (let ((.cse32 (div .cse34 50)) (.cse33 (div (+ (div .cse34 10) 1) 5))) (and (= (mod (+ .cse32 1) 29) 0) (<= (mod .cse32 29) .cse2) (= (mod (+ .cse33 1) 29) 0) (= (mod .cse34 10) 0) (not (< .cse33 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse36 10))) (let ((.cse37 (div (+ .cse35 1) 5))) (and (= (mod .cse35 5) 0) (<= (mod (div .cse36 50) 29) .cse2) (= (mod (+ .cse37 1) 29) 0) (not (< .cse37 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) (not (< .cse39 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div (+ (div .cse42 10) 1) 5))) (and (= (mod .cse41 29) 0) (<= (mod (div .cse42 50) 29) .cse2) (= (mod .cse42 10) 0) (<= 0 (+ .cse41 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse43 (div .cse44 50))) (and (= (mod (+ .cse43 1) 29) 0) (<= (mod .cse43 29) .cse2) (not (< (div .cse44 10) 0)) (= (mod .cse44 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse47 (* 9 v_~a29~0_899))) (let ((.cse46 (div .cse47 50)) (.cse45 (div .cse47 10))) (and (= (mod (div (+ .cse45 1) 5) 29) 0) (= (mod (+ .cse46 1) 29) 0) (<= (mod .cse46 29) .cse2) (not (< .cse45 0)) (= (mod .cse47 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse50 (div .cse48 50))) (let ((.cse49 (mod .cse50 29))) (and (= (mod (div (+ (div .cse48 10) 1) 5) 29) 0) (<= .cse49 .cse2) (= 0 .cse49) (not (< (+ .cse50 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse51 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse53 (div .cse51 5))) (let ((.cse52 (+ .cse53 1))) (and (not (= (mod .cse51 5) 0)) (not (< .cse52 0)) (< .cse53 0) (<= (mod .cse52 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse55 (* 9 v_~a29~0_899))) (let ((.cse57 (+ (div .cse55 10) 1))) (let ((.cse56 (div .cse57 5))) (let ((.cse54 (mod .cse56 29))) (and (= .cse54 0) (not (= (mod .cse55 10) 0)) (< (+ .cse56 1) 0) (<= .cse54 .cse2) (= (mod .cse57 5) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse58 (div .cse60 10))) (let ((.cse59 (div (+ .cse58 1) 5))) (and (= (mod .cse58 5) 0) (= (mod (+ .cse59 1) 29) 0) (<= (mod (div .cse60 50) 29) .cse6) (= (mod .cse60 10) 0) (< .cse59 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse61 (* 9 v_~a29~0_899))) (let ((.cse62 (div .cse61 50))) (and (= (mod (div .cse61 10) 5) 0) (<= (mod .cse62 29) .cse2) (<= 0 .cse62) (= (mod .cse61 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse63 (* 9 v_~a29~0_899))) (let ((.cse64 (div .cse63 50))) (and (= (mod (div .cse63 10) 5) 0) (= (mod (+ .cse64 1) 29) 0) (<= (mod .cse64 29) .cse2) (not (< .cse64 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse65 (* 9 v_~a29~0_899))) (let ((.cse66 (+ (div .cse65 10) 1)) (.cse67 (div .cse65 50))) (and (not (= (mod .cse65 10) 0)) (<= (mod (div .cse66 5) 29) .cse6) (= 0 (mod .cse67 29)) (= (mod .cse66 5) 0) (< (+ .cse67 1) 0))))) (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))))) (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) (= (mod .cse71 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse72 (* 9 v_~a29~0_899))) (let ((.cse74 (div (+ (div .cse72 10) 1) 5))) (let ((.cse73 (mod (+ .cse74 1) 29))) (and (= (mod (+ (div .cse72 50) 1) 29) 0) (not (= (mod .cse72 10) 0)) (= .cse73 0) (< .cse74 0) (<= .cse73 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (= (mod (+ .cse75 1) 29) 0) (<= (mod .cse75 29) .cse2) (not (< (div .cse76 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse79 (* 9 v_~a29~0_899))) (let ((.cse77 (div .cse79 10)) (.cse78 (div .cse79 50))) (and (= (mod .cse77 5) 0) (<= (mod .cse78 29) .cse2) (= (mod (+ (div (+ .cse77 1) 5) 1) 29) 0) (<= 0 .cse78))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse84 (+ (div .cse81 10) 1))) (let ((.cse83 (div .cse84 5))) (let ((.cse82 (mod .cse83 29)) (.cse80 (div .cse81 50))) (and (not (= 0 (mod .cse80 29))) (not (= (mod .cse81 10) 0)) (not (= .cse82 0)) (<= .cse82 .cse6) (not (= (mod (+ .cse83 1) 29) 0)) (= (mod .cse84 5) 0) (< (+ .cse80 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse86 (div .cse85 50))) (and (= (mod (div (+ (div .cse85 10) 1) 5) 29) 0) (<= (mod .cse86 29) .cse2) (<= 0 .cse86))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse89 (div .cse87 50))) (let ((.cse88 (mod .cse89 29))) (and (= (mod (div .cse87 10) 5) 0) (<= .cse88 .cse2) (= 0 .cse88) (not (< (+ .cse89 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse91 (* 9 v_~a29~0_899))) (let ((.cse90 (div (+ (div .cse91 10) 1) 5))) (and (<= 0 .cse90) (<= (mod .cse90 29) .cse2) (< .cse91 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (let ((.cse92 (div .cse94 10)) (.cse93 (mod (+ (div .cse94 50) 1) 29))) (and (= (mod (div (+ .cse92 1) 5) 29) 0) (= .cse93 0) (= (mod .cse94 10) 0) (< .cse92 0) (<= .cse93 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (* 9 v_~a29~0_899))) (let ((.cse95 (mod (div (+ (div .cse96 10) 1) 5) 29))) (and (= .cse95 0) (<= .cse95 .cse2) (< .cse96 0) (not (< (+ (div .cse96 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse97 29) .cse2) (<= 0 .cse97)))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse100 10)) (.cse99 (div .cse100 50))) (and (= (mod .cse98 5) 0) (= (mod (div (+ .cse98 1) 5) 29) 0) (<= (mod .cse99 29) .cse2) (= (mod .cse100 10) 0) (< (+ .cse99 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse104 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse104 10))) (let ((.cse103 (div (+ .cse102 1) 5)) (.cse101 (mod (+ (div .cse104 50) 1) 29))) (and (= .cse101 0) (not (= (mod .cse102 5) 0)) (= (mod (+ .cse103 1) 29) 0) (= (mod .cse104 10) 0) (< .cse103 0) (<= .cse101 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse108 (* 9 v_~a29~0_899))) (let ((.cse106 (div .cse108 50))) (let ((.cse105 (div .cse108 10)) (.cse107 (+ .cse106 1))) (and (= (mod (div (+ .cse105 1) 5) 29) 0) (not (= (mod .cse105 5) 0)) (= 0 (mod .cse106 29)) (<= (mod .cse107 29) .cse6) (= (mod .cse108 10) 0) (< .cse107 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse110 (* 9 v_~a29~0_899))) (let ((.cse111 (div .cse110 50))) (let ((.cse109 (mod .cse111 29))) (and (<= .cse109 .cse2) (= 0 .cse109) (= (mod .cse110 10) 0) (not (< (+ .cse111 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse113 (div .cse112 50))) (let ((.cse114 (+ .cse113 1))) (and (not (= (mod (div (+ (div .cse112 10) 1) 5) 29) 0)) (= 0 (mod .cse113 29)) (<= (mod .cse114 29) .cse6) (= (mod .cse112 10) 0) (< .cse114 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse117 50))) (let ((.cse118 (+ (div .cse117 10) 1)) (.cse116 (+ .cse115 1))) (and (not (= 0 (mod .cse115 29))) (not (= (mod .cse116 29) 0)) (not (= (mod .cse117 10) 0)) (not (= (mod .cse118 5) 0)) (<= (mod (+ (div .cse118 5) 1) 29) .cse6) (< .cse116 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) .cse6) (< (+ (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) .cse6) (= (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 ((.cse138 (div .cse140 10)) (.cse139 (div .cse140 50))) (and (= (mod .cse138 5) 0) (<= (mod .cse139 29) .cse2) (= (mod (+ (div (+ .cse138 1) 5) 1) 29) 0) (<= 0 .cse139) (= (mod .cse140 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse141 (+ (div .cse142 10) 1))) (and (not (< .cse141 0)) (<= (mod (div .cse141 5) 29) .cse2) (< .cse142 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse143 50))) (let ((.cse144 (mod .cse145 29))) (and (= (mod (div .cse143 10) 5) 0) (<= .cse144 .cse2) (= 0 .cse144) (= (mod .cse143 10) 0) (not (< (+ .cse145 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse146 (div .cse147 50))) (and (<= (mod .cse146 29) .cse2) (<= 0 .cse146) (= (mod .cse147 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse148 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse148 50))) (and (= (mod (div .cse148 10) 5) 0) (<= (mod .cse149 29) .cse2) (<= 0 .cse149))))))) is different from true