./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 2329fc70 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_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 17:01:04,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:01:04,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:01:04,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:01:04,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:01:04,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:01:04,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:01:04,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:01:04,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:01:04,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:01:04,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:01:04,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:01:04,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:01:04,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:01:04,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:01:04,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:01:04,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:01:04,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:01:04,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:01:04,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:01:04,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:01:04,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:01:04,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:01:04,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:01:04,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:01:04,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:01:04,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:01:04,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:01:04,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:01:04,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:01:04,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:01:04,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:01:04,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:01:04,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:01:04,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:01:04,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:01:04,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:01:04,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:01:04,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:01:04,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:01:04,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:01:04,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:01:04,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:01:04,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:01:04,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:01:04,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:01:04,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:01:04,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:01:04,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:01:04,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:01:04,282 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:01:04,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:01:04,282 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:01:04,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:01:04,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:01:04,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:01:04,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:01:04,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:01:04,285 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/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_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8 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-12-13 17:01:04,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:01:04,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:01:04,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:01:04,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:01:04,471 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:01:04,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-12-13 17:01:07,128 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:01:07,366 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:01:07,366 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/sv-benchmarks/c/eca-rers2012/Problem15_label55.c [2022-12-13 17:01:07,378 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/data/396d228f0/821f03fdf48a4562986f812bfa04aae9/FLAGc66c2760d [2022-12-13 17:01:07,388 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/data/396d228f0/821f03fdf48a4562986f812bfa04aae9 [2022-12-13 17:01:07,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:01:07,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:01:07,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:01:07,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:01:07,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:01:07,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:01:07" (1/1) ... [2022-12-13 17:01:07,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35598473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:07, skipping insertion in model container [2022-12-13 17:01:07,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:01:07" (1/1) ... [2022-12-13 17:01:07,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:01:07,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:01:07,593 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-12-13 17:01:07,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:01:07,875 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:01:07,893 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/sv-benchmarks/c/eca-rers2012/Problem15_label55.c[6938,6951] [2022-12-13 17:01:08,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:01:08,119 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:01:08,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08 WrapperNode [2022-12-13 17:01:08,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:01:08,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:01:08,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:01:08,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:01:08,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,282 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-12-13 17:01:08,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:01:08,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:01:08,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:01:08,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:01:08,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,375 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:01:08,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:01:08,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:01:08,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:01:08,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (1/1) ... [2022-12-13 17:01:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:01:08,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:08,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:01:08,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:01:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:01:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:01:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:01:08,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:01:08,522 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:01:08,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:01:10,948 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:01:10,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:01:10,957 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 17:01:10,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:01:10 BoogieIcfgContainer [2022-12-13 17:01:10,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:01:10,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:01:10,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:01:10,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:01:10,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:01:07" (1/3) ... [2022-12-13 17:01:10,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39406aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:01:10, skipping insertion in model container [2022-12-13 17:01:10,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:01:08" (2/3) ... [2022-12-13 17:01:10,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39406aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:01:10, skipping insertion in model container [2022-12-13 17:01:10,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:01:10" (3/3) ... [2022-12-13 17:01:10,965 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label55.c [2022-12-13 17:01:10,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:01:10,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:01:11,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:01:11,026 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;@24d05642, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:01:11,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:01:11,031 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-12-13 17:01:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 17:01:11,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:11,037 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-12-13 17:01:11,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2022-12-13 17:01:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789266762] [2022-12-13 17:01:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:01:11,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789266762] [2022-12-13 17:01:11,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789266762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:11,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:11,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:01:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549765171] [2022-12-13 17:01:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:11,310 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-12-13 17:01:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:12,923 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2022-12-13 17:01:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:12,925 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-12-13 17:01:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:12,935 INFO L225 Difference]: With dead ends: 1155 [2022-12-13 17:01:12,936 INFO L226 Difference]: Without dead ends: 667 [2022-12-13 17:01:12,939 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-12-13 17:01:12,941 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 287 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:12,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 17:01:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-12-13 17:01:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2022-12-13 17:01:12,987 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-12-13 17:01:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2022-12-13 17:01:12,990 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 57 [2022-12-13 17:01:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:12,991 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2022-12-13 17:01:12,991 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-12-13 17:01:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2022-12-13 17:01:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 17:01:12,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:12,994 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-12-13 17:01:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:01:12,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -664289441, now seen corresponding path program 1 times [2022-12-13 17:01:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842846880] [2022-12-13 17:01:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:01:13,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:13,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842846880] [2022-12-13 17:01:13,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842846880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:13,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:13,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:01:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583586307] [2022-12-13 17:01:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:13,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:13,142 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-12-13 17:01:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:15,043 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2022-12-13 17:01:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:15,044 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-12-13 17:01:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:15,046 INFO L225 Difference]: With dead ends: 1953 [2022-12-13 17:01:15,047 INFO L226 Difference]: Without dead ends: 1290 [2022-12-13 17:01:15,047 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-12-13 17:01:15,048 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:15,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 325 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 17:01:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-12-13 17:01:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2022-12-13 17:01:15,068 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-12-13 17:01:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2022-12-13 17:01:15,070 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 132 [2022-12-13 17:01:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:15,071 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2022-12-13 17:01:15,071 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-12-13 17:01:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2022-12-13 17:01:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 17:01:15,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:15,073 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-12-13 17:01:15,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:01:15,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash 22508777, now seen corresponding path program 1 times [2022-12-13 17:01:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:15,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690054310] [2022-12-13 17:01:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:01:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:15,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690054310] [2022-12-13 17:01:15,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690054310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:15,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:15,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:01:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254115031] [2022-12-13 17:01:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:15,205 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-12-13 17:01:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:16,947 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2022-12-13 17:01:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:16,947 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-12-13 17:01:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:16,954 INFO L225 Difference]: With dead ends: 3764 [2022-12-13 17:01:16,954 INFO L226 Difference]: Without dead ends: 2484 [2022-12-13 17:01:16,955 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-12-13 17:01:16,956 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:16,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-13 17:01:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-12-13 17:01:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2022-12-13 17:01:16,979 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-12-13 17:01:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2022-12-13 17:01:16,982 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 136 [2022-12-13 17:01:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:16,982 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2022-12-13 17:01:16,983 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-12-13 17:01:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2022-12-13 17:01:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-13 17:01:16,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:16,985 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-12-13 17:01:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:01:16,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:16,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1359144620, now seen corresponding path program 1 times [2022-12-13 17:01:16,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:16,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844526904] [2022-12-13 17:01:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 17:01:17,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844526904] [2022-12-13 17:01:17,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844526904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:17,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:17,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:01:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256604398] [2022-12-13 17:01:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:17,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:17,170 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-12-13 17:01:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:18,548 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2022-12-13 17:01:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:18,548 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-12-13 17:01:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:18,556 INFO L225 Difference]: With dead ends: 6166 [2022-12-13 17:01:18,556 INFO L226 Difference]: Without dead ends: 3986 [2022-12-13 17:01:18,558 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-12-13 17:01:18,559 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:18,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 17:01:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-12-13 17:01:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2022-12-13 17:01:18,597 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-12-13 17:01:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2022-12-13 17:01:18,602 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 227 [2022-12-13 17:01:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:18,603 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2022-12-13 17:01:18,603 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-12-13 17:01:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2022-12-13 17:01:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-12-13 17:01:18,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:18,606 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-12-13 17:01:18,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:01:18,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash -764479700, now seen corresponding path program 1 times [2022-12-13 17:01:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:18,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475475402] [2022-12-13 17:01:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 17:01:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:19,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475475402] [2022-12-13 17:01:19,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475475402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:19,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:19,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:01:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850089550] [2022-12-13 17:01:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:19,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:19,074 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-12-13 17:01:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:20,717 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2022-12-13 17:01:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:20,718 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-12-13 17:01:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:20,725 INFO L225 Difference]: With dead ends: 7661 [2022-12-13 17:01:20,725 INFO L226 Difference]: Without dead ends: 3981 [2022-12-13 17:01:20,726 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-12-13 17:01:20,727 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:20,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 17:01:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2022-12-13 17:01:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2022-12-13 17:01:20,763 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-12-13 17:01:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2022-12-13 17:01:20,768 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 329 [2022-12-13 17:01:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:20,769 INFO L495 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2022-12-13 17:01:20,769 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-12-13 17:01:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2022-12-13 17:01:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-12-13 17:01:20,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:20,773 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-12-13 17:01:20,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:01:20,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1396325859, now seen corresponding path program 1 times [2022-12-13 17:01:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:20,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637030232] [2022-12-13 17:01:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 17:01:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:21,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637030232] [2022-12-13 17:01:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637030232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:21,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988118521] [2022-12-13 17:01:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:21,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:21,025 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-12-13 17:01:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:22,599 INFO L93 Difference]: Finished difference Result 9465 states and 11674 transitions. [2022-12-13 17:01:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:22,600 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-12-13 17:01:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:22,609 INFO L225 Difference]: With dead ends: 9465 [2022-12-13 17:01:22,609 INFO L226 Difference]: Without dead ends: 5785 [2022-12-13 17:01:22,611 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-12-13 17:01:22,612 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 259 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:22,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 17:01:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2022-12-13 17:01:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783. [2022-12-13 17:01:22,660 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-12-13 17:01:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6751 transitions. [2022-12-13 17:01:22,667 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6751 transitions. Word has length 344 [2022-12-13 17:01:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:22,667 INFO L495 AbstractCegarLoop]: Abstraction has 5783 states and 6751 transitions. [2022-12-13 17:01:22,667 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-12-13 17:01:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6751 transitions. [2022-12-13 17:01:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-12-13 17:01:22,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:22,672 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-12-13 17:01:22,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:01:22,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1074223962, now seen corresponding path program 1 times [2022-12-13 17:01:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:22,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765866515] [2022-12-13 17:01:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 17:01:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765866515] [2022-12-13 17:01:22,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765866515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:22,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:22,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063316900] [2022-12-13 17:01:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:22,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:22,919 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-12-13 17:01:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:24,418 INFO L93 Difference]: Finished difference Result 13364 states and 15910 transitions. [2022-12-13 17:01:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:24,419 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-12-13 17:01:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:24,430 INFO L225 Difference]: With dead ends: 13364 [2022-12-13 17:01:24,430 INFO L226 Difference]: Without dead ends: 7882 [2022-12-13 17:01:24,433 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-12-13 17:01:24,433 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 270 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:24,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 17:01:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2022-12-13 17:01:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7284. [2022-12-13 17:01:24,491 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-12-13 17:01:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8366 transitions. [2022-12-13 17:01:24,498 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8366 transitions. Word has length 403 [2022-12-13 17:01:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:24,499 INFO L495 AbstractCegarLoop]: Abstraction has 7284 states and 8366 transitions. [2022-12-13 17:01:24,499 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-12-13 17:01:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8366 transitions. [2022-12-13 17:01:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-12-13 17:01:24,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:24,501 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-12-13 17:01:24,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:01:24,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1496156917, now seen corresponding path program 1 times [2022-12-13 17:01:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:24,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184957306] [2022-12-13 17:01:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 17:01:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:24,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184957306] [2022-12-13 17:01:24,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184957306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:24,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:24,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908344009] [2022-12-13 17:01:24,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:24,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:24,750 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-12-13 17:01:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:26,105 INFO L93 Difference]: Finished difference Result 16069 states and 18814 transitions. [2022-12-13 17:01:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:26,106 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-12-13 17:01:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:26,120 INFO L225 Difference]: With dead ends: 16069 [2022-12-13 17:01:26,120 INFO L226 Difference]: Without dead ends: 9086 [2022-12-13 17:01:26,123 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-12-13 17:01:26,124 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 272 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:26,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 17:01:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2022-12-13 17:01:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2022-12-13 17:01:26,188 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-12-13 17:01:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9650 transitions. [2022-12-13 17:01:26,195 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9650 transitions. Word has length 418 [2022-12-13 17:01:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:26,196 INFO L495 AbstractCegarLoop]: Abstraction has 8481 states and 9650 transitions. [2022-12-13 17:01:26,196 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-12-13 17:01:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9650 transitions. [2022-12-13 17:01:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2022-12-13 17:01:26,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:26,199 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-12-13 17:01:26,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:01:26,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:26,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1478191957, now seen corresponding path program 1 times [2022-12-13 17:01:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:26,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418389100] [2022-12-13 17:01:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-12-13 17:01:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:26,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418389100] [2022-12-13 17:01:26,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418389100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:26,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:26,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730168922] [2022-12-13 17:01:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:26,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:26,416 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-12-13 17:01:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:27,873 INFO L93 Difference]: Finished difference Result 19651 states and 22543 transitions. [2022-12-13 17:01:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:27,874 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-12-13 17:01:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:27,885 INFO L225 Difference]: With dead ends: 19651 [2022-12-13 17:01:27,885 INFO L226 Difference]: Without dead ends: 11471 [2022-12-13 17:01:27,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-12-13 17:01:27,890 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:27,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 17:01:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2022-12-13 17:01:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2022-12-13 17:01:27,952 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-12-13 17:01:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8703 transitions. [2022-12-13 17:01:27,970 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8703 transitions. Word has length 508 [2022-12-13 17:01:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:27,970 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 8703 transitions. [2022-12-13 17:01:27,970 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-12-13 17:01:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8703 transitions. [2022-12-13 17:01:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2022-12-13 17:01:27,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:27,974 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-12-13 17:01:27,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:01:27,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -732988878, now seen corresponding path program 1 times [2022-12-13 17:01:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:27,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80853177] [2022-12-13 17:01:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 519 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-12-13 17:01:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80853177] [2022-12-13 17:01:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80853177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834579566] [2022-12-13 17:01:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:28,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:28,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:28,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:01:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:28,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:01:28,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-12-13 17:01:28,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:01:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834579566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:28,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:01:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 17:01:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969393039] [2022-12-13 17:01:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:01:28,793 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-12-13 17:01:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:30,190 INFO L93 Difference]: Finished difference Result 17246 states and 20055 transitions. [2022-12-13 17:01:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:30,191 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-12-13 17:01:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:30,201 INFO L225 Difference]: With dead ends: 17246 [2022-12-13 17:01:30,201 INFO L226 Difference]: Without dead ends: 9969 [2022-12-13 17:01:30,205 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-12-13 17:01:30,205 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:30,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 17:01:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2022-12-13 17:01:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2022-12-13 17:01:30,279 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-12-13 17:01:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11463 transitions. [2022-12-13 17:01:30,287 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11463 transitions. Word has length 541 [2022-12-13 17:01:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:30,288 INFO L495 AbstractCegarLoop]: Abstraction has 9969 states and 11463 transitions. [2022-12-13 17:01:30,288 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-12-13 17:01:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11463 transitions. [2022-12-13 17:01:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2022-12-13 17:01:30,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:30,291 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-12-13 17:01:30,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:01:30,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 17:01:30,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -93352388, now seen corresponding path program 1 times [2022-12-13 17:01:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506788495] [2022-12-13 17:01:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-12-13 17:01:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:30,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506788495] [2022-12-13 17:01:30,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506788495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:30,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:30,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852256541] [2022-12-13 17:01:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:30,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:30,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:30,874 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-12-13 17:01:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:32,835 INFO L93 Difference]: Finished difference Result 24136 states and 28002 transitions. [2022-12-13 17:01:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:32,836 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-12-13 17:01:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:32,849 INFO L225 Difference]: With dead ends: 24136 [2022-12-13 17:01:32,850 INFO L226 Difference]: Without dead ends: 14468 [2022-12-13 17:01:32,855 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-12-13 17:01:32,855 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:32,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 17:01:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2022-12-13 17:01:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2022-12-13 17:01:32,975 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-12-13 17:01:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16066 transitions. [2022-12-13 17:01:33,019 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16066 transitions. Word has length 545 [2022-12-13 17:01:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:33,020 INFO L495 AbstractCegarLoop]: Abstraction has 14158 states and 16066 transitions. [2022-12-13 17:01:33,020 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-12-13 17:01:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16066 transitions. [2022-12-13 17:01:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2022-12-13 17:01:33,027 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:33,028 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-12-13 17:01:33,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:01:33,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1966218800, now seen corresponding path program 1 times [2022-12-13 17:01:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:33,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627065634] [2022-12-13 17:01:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 676 proven. 39 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-12-13 17:01:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:33,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627065634] [2022-12-13 17:01:33,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627065634] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094260679] [2022-12-13 17:01:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:33,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:33,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:33,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:33,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:01:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:33,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:01:33,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-12-13 17:01:33,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:01:33,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094260679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:33,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:01:33,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 17:01:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711913240] [2022-12-13 17:01:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:01:33,818 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-12-13 17:01:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:35,578 INFO L93 Difference]: Finished difference Result 27712 states and 31490 transitions. [2022-12-13 17:01:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:35,579 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-12-13 17:01:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:35,590 INFO L225 Difference]: With dead ends: 27712 [2022-12-13 17:01:35,590 INFO L226 Difference]: Without dead ends: 13855 [2022-12-13 17:01:35,596 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-12-13 17:01:35,596 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:35,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-13 17:01:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2022-12-13 17:01:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13854. [2022-12-13 17:01:35,700 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-12-13 17:01:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2022-12-13 17:01:35,715 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 620 [2022-12-13 17:01:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:35,715 INFO L495 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2022-12-13 17:01:35,716 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-12-13 17:01:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2022-12-13 17:01:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2022-12-13 17:01:35,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:35,722 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-12-13 17:01:35,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 17:01:35,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 17:01:35,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:35,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1575532913, now seen corresponding path program 1 times [2022-12-13 17:01:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:35,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318711134] [2022-12-13 17:01:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-12-13 17:01:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318711134] [2022-12-13 17:01:36,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318711134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:36,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173437880] [2022-12-13 17:01:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:36,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:36,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:36,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:01:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:36,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:01:36,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-12-13 17:01:37,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:01:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 603 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-12-13 17:01:37,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173437880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:01:37,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:01:37,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 17:01:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973814252] [2022-12-13 17:01:37,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:01:37,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:01:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:01:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:01:37,839 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-12-13 17:01:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:43,615 INFO L93 Difference]: Finished difference Result 35741 states and 38659 transitions. [2022-12-13 17:01:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:01:43,616 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-12-13 17:01:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:43,627 INFO L225 Difference]: With dead ends: 35741 [2022-12-13 17:01:43,627 INFO L226 Difference]: Without dead ends: 16247 [2022-12-13 17:01:43,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1236 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:01:43,635 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2850 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5909 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 5909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:43,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 246 Invalid, 6567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 5909 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-13 17:01:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2022-12-13 17:01:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2022-12-13 17:01:43,745 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-12-13 17:01:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12833 transitions. [2022-12-13 17:01:43,755 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12833 transitions. Word has length 621 [2022-12-13 17:01:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:43,755 INFO L495 AbstractCegarLoop]: Abstraction has 12357 states and 12833 transitions. [2022-12-13 17:01:43,755 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-12-13 17:01:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12833 transitions. [2022-12-13 17:01:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2022-12-13 17:01:43,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:43,760 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-12-13 17:01:43,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:01:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:43,961 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1914023780, now seen corresponding path program 1 times [2022-12-13 17:01:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925107785] [2022-12-13 17:01:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-12-13 17:01:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925107785] [2022-12-13 17:01:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925107785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:44,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124494055] [2022-12-13 17:01:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:44,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:44,271 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-12-13 17:01:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:45,163 INFO L93 Difference]: Finished difference Result 28295 states and 29436 transitions. [2022-12-13 17:01:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:45,164 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-12-13 17:01:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:45,175 INFO L225 Difference]: With dead ends: 28295 [2022-12-13 17:01:45,175 INFO L226 Difference]: Without dead ends: 15940 [2022-12-13 17:01:45,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:45,182 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 257 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:45,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:01:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-12-13 17:01:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2022-12-13 17:01:45,300 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-12-13 17:01:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2022-12-13 17:01:45,313 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 658 [2022-12-13 17:01:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:45,313 INFO L495 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2022-12-13 17:01:45,313 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-12-13 17:01:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2022-12-13 17:01:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2022-12-13 17:01:45,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:45,319 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-12-13 17:01:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:01:45,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1275389892, now seen corresponding path program 1 times [2022-12-13 17:01:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:45,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910797360] [2022-12-13 17:01:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:45,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-12-13 17:01:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910797360] [2022-12-13 17:01:45,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910797360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:45,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:45,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:01:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347566058] [2022-12-13 17:01:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:45,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:01:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:01:45,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:01:45,700 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-12-13 17:01:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:47,149 INFO L93 Difference]: Finished difference Result 33973 states and 35169 transitions. [2022-12-13 17:01:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:01:47,150 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-12-13 17:01:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:47,163 INFO L225 Difference]: With dead ends: 33973 [2022-12-13 17:01:47,163 INFO L226 Difference]: Without dead ends: 18932 [2022-12-13 17:01:47,170 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-12-13 17:01:47,170 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 674 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:47,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 426 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 17:01:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2022-12-13 17:01:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18035. [2022-12-13 17:01:47,304 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-12-13 17:01:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 18596 transitions. [2022-12-13 17:01:47,320 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 18596 transitions. Word has length 682 [2022-12-13 17:01:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:47,321 INFO L495 AbstractCegarLoop]: Abstraction has 18035 states and 18596 transitions. [2022-12-13 17:01:47,321 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-12-13 17:01:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 18596 transitions. [2022-12-13 17:01:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2022-12-13 17:01:47,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:47,328 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-12-13 17:01:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:01:47,328 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -402468340, now seen corresponding path program 1 times [2022-12-13 17:01:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:47,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969828832] [2022-12-13 17:01:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2022-12-13 17:01:47,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:47,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969828832] [2022-12-13 17:01:47,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969828832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:47,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:47,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117257099] [2022-12-13 17:01:47,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:47,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:47,643 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-12-13 17:01:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:48,567 INFO L93 Difference]: Finished difference Result 36065 states and 37196 transitions. [2022-12-13 17:01:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:48,568 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-12-13 17:01:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:48,580 INFO L225 Difference]: With dead ends: 36065 [2022-12-13 17:01:48,580 INFO L226 Difference]: Without dead ends: 18331 [2022-12-13 17:01:48,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:48,588 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:48,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:01:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2022-12-13 17:01:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18031. [2022-12-13 17:01:48,766 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-12-13 17:01:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 18589 transitions. [2022-12-13 17:01:48,782 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 18589 transitions. Word has length 713 [2022-12-13 17:01:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:48,782 INFO L495 AbstractCegarLoop]: Abstraction has 18031 states and 18589 transitions. [2022-12-13 17:01:48,783 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-12-13 17:01:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 18589 transitions. [2022-12-13 17:01:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2022-12-13 17:01:48,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:48,792 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-12-13 17:01:48,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:01:48,793 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1638431091, now seen corresponding path program 1 times [2022-12-13 17:01:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:48,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835531959] [2022-12-13 17:01:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-12-13 17:01:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835531959] [2022-12-13 17:01:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835531959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:49,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114391880] [2022-12-13 17:01:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:49,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:49,187 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-12-13 17:01:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:50,156 INFO L93 Difference]: Finished difference Result 38449 states and 39675 transitions. [2022-12-13 17:01:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:50,156 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-12-13 17:01:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:50,170 INFO L225 Difference]: With dead ends: 38449 [2022-12-13 17:01:50,170 INFO L226 Difference]: Without dead ends: 20719 [2022-12-13 17:01:50,177 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-12-13 17:01:50,177 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:50,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 161 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:01:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2022-12-13 17:01:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 19523. [2022-12-13 17:01:50,323 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-12-13 17:01:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19523 states to 19523 states and 20078 transitions. [2022-12-13 17:01:50,340 INFO L78 Accepts]: Start accepts. Automaton has 19523 states and 20078 transitions. Word has length 784 [2022-12-13 17:01:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:50,341 INFO L495 AbstractCegarLoop]: Abstraction has 19523 states and 20078 transitions. [2022-12-13 17:01:50,341 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-12-13 17:01:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19523 states and 20078 transitions. [2022-12-13 17:01:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2022-12-13 17:01:50,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:50,351 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-12-13 17:01:50,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:01:50,352 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -523331930, now seen corresponding path program 1 times [2022-12-13 17:01:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879453137] [2022-12-13 17:01:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-12-13 17:01:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:50,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879453137] [2022-12-13 17:01:50,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879453137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:50,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:50,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226001220] [2022-12-13 17:01:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:50,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:50,702 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-12-13 17:01:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:51,675 INFO L93 Difference]: Finished difference Result 41433 states and 42655 transitions. [2022-12-13 17:01:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:51,676 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-12-13 17:01:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:51,691 INFO L225 Difference]: With dead ends: 41433 [2022-12-13 17:01:51,691 INFO L226 Difference]: Without dead ends: 21912 [2022-12-13 17:01:51,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-12-13 17:01:51,699 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:51,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 460 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:01:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2022-12-13 17:01:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 17124. [2022-12-13 17:01:51,845 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-12-13 17:01:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 17575 transitions. [2022-12-13 17:01:51,860 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 17575 transitions. Word has length 805 [2022-12-13 17:01:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:51,861 INFO L495 AbstractCegarLoop]: Abstraction has 17124 states and 17575 transitions. [2022-12-13 17:01:51,861 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-12-13 17:01:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 17575 transitions. [2022-12-13 17:01:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2022-12-13 17:01:51,871 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:51,871 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-12-13 17:01:51,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:01:51,871 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1479206236, now seen corresponding path program 1 times [2022-12-13 17:01:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:51,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064222081] [2022-12-13 17:01:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-12-13 17:01:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:52,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064222081] [2022-12-13 17:01:52,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064222081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:52,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:01:52,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:01:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806661235] [2022-12-13 17:01:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:01:52,264 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-12-13 17:01:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:53,178 INFO L93 Difference]: Finished difference Result 36039 states and 37016 transitions. [2022-12-13 17:01:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:53,179 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-12-13 17:01:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:53,190 INFO L225 Difference]: With dead ends: 36039 [2022-12-13 17:01:53,190 INFO L226 Difference]: Without dead ends: 19216 [2022-12-13 17:01:53,195 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-12-13 17:01:53,196 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 310 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:53,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:01:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2022-12-13 17:01:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 18020. [2022-12-13 17:01:53,337 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-12-13 17:01:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 18477 transitions. [2022-12-13 17:01:53,353 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 18477 transitions. Word has length 842 [2022-12-13 17:01:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:53,353 INFO L495 AbstractCegarLoop]: Abstraction has 18020 states and 18477 transitions. [2022-12-13 17:01:53,353 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-12-13 17:01:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 18477 transitions. [2022-12-13 17:01:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2022-12-13 17:01:53,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:53,362 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-12-13 17:01:53,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:01:53,362 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -537887034, now seen corresponding path program 1 times [2022-12-13 17:01:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602994519] [2022-12-13 17:01:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 629 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-12-13 17:01:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602994519] [2022-12-13 17:01:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602994519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920835843] [2022-12-13 17:01:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:54,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:54,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:54,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:01:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:54,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 17:01:54,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2022-12-13 17:01:55,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:01:55,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920835843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:01:55,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:01:55,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 17:01:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159346044] [2022-12-13 17:01:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:01:55,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:01:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:01:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:01:55,044 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-12-13 17:01:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:56,076 INFO L93 Difference]: Finished difference Result 39939 states and 40943 transitions. [2022-12-13 17:01:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:01:56,077 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-12-13 17:01:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:56,090 INFO L225 Difference]: With dead ends: 39939 [2022-12-13 17:01:56,090 INFO L226 Difference]: Without dead ends: 21921 [2022-12-13 17:01:56,098 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-12-13 17:01:56,099 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 271 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:56,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 493 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:01:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2022-12-13 17:01:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 19818. [2022-12-13 17:01:56,266 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-12-13 17:01:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20315 transitions. [2022-12-13 17:01:56,282 INFO L78 Accepts]: Start accepts. Automaton has 19818 states and 20315 transitions. Word has length 863 [2022-12-13 17:01:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:56,283 INFO L495 AbstractCegarLoop]: Abstraction has 19818 states and 20315 transitions. [2022-12-13 17:01:56,283 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-12-13 17:01:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 19818 states and 20315 transitions. [2022-12-13 17:01:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-12-13 17:01:56,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:56,292 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-12-13 17:01:56,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 17:01:56,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:56,494 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 943867835, now seen corresponding path program 1 times [2022-12-13 17:01:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:56,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911638979] [2022-12-13 17:01:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 703 proven. 269 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-12-13 17:01:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911638979] [2022-12-13 17:01:57,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911638979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:57,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102064030] [2022-12-13 17:01:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:57,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:57,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3c37075-7102-4085-8042-8b823f801336/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:01:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:58,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:01:58,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:08:34,475 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 17:09:41,147 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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse18 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse18 10))) (let ((.cse17 (div (+ .cse16 1) 5))) (and (= (mod .cse16 5) 0) (= (mod .cse17 29) 0) (<= (mod (div .cse18 50) 29) .cse2) (= (mod .cse18 10) 0) (<= 0 (+ .cse17 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse21 (* 9 v_~a29~0_899))) (let ((.cse19 (div .cse21 10))) (let ((.cse20 (div (+ .cse19 1) 5))) (and (= (mod .cse19 5) 0) (= (mod .cse20 29) 0) (<= (mod (div .cse21 50) 29) .cse2) (<= 0 (+ .cse20 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse22 (+ (div .cse23 10) 1))) (and (<= (mod (div .cse22 5) 29) .cse2) (< .cse23 0) (= (mod .cse22 5) 0) (not (< (+ (div .cse23 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse24 (* 9 v_~a29~0_899))) (let ((.cse26 (div .cse24 50))) (let ((.cse25 (mod .cse26 29))) (and (= (mod (div (+ (div .cse24 10) 1) 5) 29) 0) (<= .cse25 .cse2) (= 0 .cse25) (= (mod .cse24 10) 0) (not (< (+ .cse26 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse30 50))) (let ((.cse27 (div (+ (div .cse30 10) 1) 5)) (.cse29 (+ .cse28 1))) (and (not (= (mod .cse27 29) 0)) (= 0 (mod .cse28 29)) (<= (mod .cse29 29) .cse6) (= (mod .cse30 10) 0) (not (= (mod (+ .cse27 1) 29) 0)) (< .cse29 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (div (* 9 v_~a29~0_899) 50))) (let ((.cse31 (mod .cse32 29))) (and (<= .cse31 .cse2) (= 0 .cse31) (not (< (+ .cse32 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse33 (div .cse35 50)) (.cse34 (div (+ (div .cse35 10) 1) 5))) (and (= (mod (+ .cse33 1) 29) 0) (<= (mod .cse33 29) .cse2) (= (mod (+ .cse34 1) 29) 0) (= (mod .cse35 10) 0) (not (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.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 ((.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) .cse6) (= (mod .cse57 10) 0) (< .cse56 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse59 (* 9 v_~a29~0_899))) (let ((.cse58 (div (+ (div .cse59 10) 1) 5)) (.cse60 (div .cse59 50))) (and (= (mod .cse58 29) 0) (not (= (mod .cse59 10) 0)) (<= (mod (+ .cse58 1) 29) .cse6) (= 0 (mod .cse60 29)) (< (+ .cse60 1) 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 ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse71 (+ (div .cse70 10) 1))) (let ((.cse73 (div .cse71 5))) (let ((.cse72 (mod (+ .cse73 1) 29))) (and (= (mod (+ (div .cse70 50) 1) 29) 0) (not (= (mod .cse70 10) 0)) (not (= (mod .cse71 5) 0)) (= .cse72 0) (< .cse73 0) (<= .cse72 .cse2))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse75 (* 9 v_~a29~0_899))) (let ((.cse74 (div .cse75 50))) (and (<= (mod .cse74 29) .cse2) (= (mod (+ (div (+ (div .cse75 10) 1) 5) 1) 29) 0) (<= 0 .cse74) (= (mod .cse75 10) 0))))) (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 ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse81 50))) (and (= (mod (div (+ (div .cse81 10) 1) 5) 29) 0) (<= (mod .cse82 29) .cse2) (<= 0 .cse82))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10)) (.cse89 (mod (+ (div .cse90 50) 1) 29))) (and (= (mod (div (+ .cse88 1) 5) 29) 0) (= .cse89 0) (= (mod .cse90 10) 0) (< .cse88 0) (<= .cse89 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (mod (div (+ (div .cse92 10) 1) 5) 29))) (and (= .cse91 0) (<= .cse91 .cse2) (< .cse92 0) (not (< (+ (div .cse92 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse93 29) .cse2) (<= 0 .cse93)))) (exists ((v_~a29~0_899 Int)) (let ((.cse94 (* 9 v_~a29~0_899))) (and (= (mod (+ (div (+ (div .cse94 10) 1) 5) 1) 29) 0) (= 0 (mod (div .cse94 50) 29))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse96 (div .cse98 10))) (let ((.cse97 (div (+ .cse96 1) 5)) (.cse95 (mod (+ (div .cse98 50) 1) 29))) (and (= .cse95 0) (not (= (mod .cse96 5) 0)) (= (mod (+ .cse97 1) 29) 0) (= (mod .cse98 10) 0) (< .cse97 0) (<= .cse95 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse99 (* 9 v_~a29~0_899))) (let ((.cse101 (div .cse99 50))) (let ((.cse100 (mod .cse101 29))) (and (= (mod (div .cse99 10) 5) 0) (<= .cse100 .cse2) (= 0 .cse100) (= (mod .cse99 10) 0) (< (+ .cse101 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse106 (* 9 v_~a29~0_899))) (let ((.cse102 (div .cse106 50))) (let ((.cse104 (div .cse106 10)) (.cse107 (+ .cse102 1))) (let ((.cse103 (mod .cse107 29)) (.cse105 (div (+ .cse104 1) 5))) (and (not (= 0 (mod .cse102 29))) (not (= .cse103 0)) (not (= (mod .cse104 5) 0)) (not (= (mod .cse105 29) 0)) (<= .cse103 .cse6) (= (mod .cse106 10) 0) (not (= (mod (+ .cse105 1) 29) 0)) (< .cse107 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse109 (div .cse111 50))) (let ((.cse108 (div .cse111 10)) (.cse110 (+ .cse109 1))) (and (= (mod (div (+ .cse108 1) 5) 29) 0) (not (= (mod .cse108 5) 0)) (= 0 (mod .cse109 29)) (<= (mod .cse110 29) .cse6) (= (mod .cse111 10) 0) (< .cse110 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse113 50))) (let ((.cse112 (mod .cse114 29))) (and (<= .cse112 .cse2) (= 0 .cse112) (= (mod .cse113 10) 0) (not (< (+ .cse114 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse115 (+ (div .cse116 10) 1))) (and (= (mod (div .cse115 5) 29) 0) (= (mod (+ (div .cse116 50) 1) 29) 0) (not (= (mod .cse116 10) 0)) (not (= (mod .cse115 5) 0)) (< .cse116 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse117 (* 9 v_~a29~0_899))) (let ((.cse118 (div .cse117 50))) (and (= (mod (div .cse117 10) 5) 0) (= (mod (+ .cse118 1) 29) 0) (<= (mod .cse118 29) .cse2) (not (< .cse118 0)) (= (mod .cse117 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div (+ (div .cse121 10) 1) 5))) (let ((.cse119 (mod .cse120 29))) (and (= .cse119 0) (not (< (+ .cse120 1) 0)) (<= .cse119 .cse2) (< .cse121 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5))) (and (< .cse122 0) (<= (mod (+ .cse122 1) 29) .cse2) (not (< (+ (div .cse123 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse124 (* 9 v_~a29~0_899))) (let ((.cse126 (+ (div .cse124 10) 1))) (let ((.cse125 (div .cse126 5))) (and (= (mod (+ (div .cse124 50) 1) 29) 0) (not (= (mod .cse124 10) 0)) (< (+ .cse125 1) 0) (<= (mod .cse125 29) .cse2) (= (mod .cse126 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse128 (* 9 v_~a29~0_899))) (let ((.cse127 (div (+ (div .cse128 10) 1) 5))) (and (not (< (+ .cse127 1) 0)) (<= (mod .cse127 29) .cse6) (< (+ (div .cse128 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse132 (* 9 v_~a29~0_899))) (let ((.cse129 (div .cse132 50))) (let ((.cse131 (div (+ (div .cse132 10) 1) 5)) (.cse130 (+ .cse129 1))) (and (not (= 0 (mod .cse129 29))) (not (= (mod .cse130 29) 0)) (= (mod .cse131 29) 0) (not (= (mod .cse132 10) 0)) (<= (mod (+ .cse131 1) 29) .cse6) (< .cse130 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse134 (+ (div .cse133 10) 1))) (let ((.cse135 (div .cse134 5))) (let ((.cse136 (mod (+ .cse135 1) 29))) (and (= (mod (+ (div .cse133 50) 1) 29) 0) (not (= (mod .cse133 10) 0)) (not (= (mod .cse134 5) 0)) (not (= (mod .cse135 29) 0)) (<= .cse136 .cse6) (not (= .cse136 0)) (< .cse133 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse140 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse140 10))) (let ((.cse138 (div (+ .cse137 1) 5)) (.cse139 (div .cse140 50))) (and (= (mod .cse137 5) 0) (not (= (mod .cse138 29) 0)) (<= (mod .cse139 29) .cse6) (= (mod .cse140 10) 0) (not (= (mod (+ .cse138 1) 29) 0)) (< (+ .cse139 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse142 (div .cse143 50)) (.cse141 (div .cse143 10))) (and (= (mod (div (+ .cse141 1) 5) 29) 0) (= (mod (+ .cse142 1) 29) 0) (<= (mod .cse142 29) .cse2) (not (< .cse141 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse144 (* 9 v_~a29~0_899))) (let ((.cse145 (+ (div .cse144 10) 1))) (let ((.cse146 (div .cse145 5))) (let ((.cse147 (mod (+ .cse146 1) 29)) (.cse148 (div .cse144 50))) (and (not (= (mod .cse144 10) 0)) (not (= (mod .cse145 5) 0)) (not (= (mod .cse146 29) 0)) (<= .cse147 .cse6) (= 0 (mod .cse148 29)) (not (= .cse147 0)) (< (+ .cse148 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse150 10))) (let ((.cse151 (div (+ .cse149 1) 5))) (and (= (mod .cse149 5) 0) (<= (mod (div .cse150 50) 29) .cse2) (= (mod (+ .cse151 1) 29) 0) (= (mod .cse150 10) 0) (not (< .cse151 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse154 (* 9 v_~a29~0_899))) (let ((.cse152 (div .cse154 10)) (.cse153 (div .cse154 50))) (and (= (mod .cse152 5) 0) (<= (mod .cse153 29) .cse2) (= (mod (+ (div (+ .cse152 1) 5) 1) 29) 0) (<= 0 .cse153) (= (mod .cse154 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse156 (* 9 v_~a29~0_899))) (let ((.cse155 (+ (div .cse156 10) 1))) (and (not (< .cse155 0)) (<= (mod (div .cse155 5) 29) .cse2) (< .cse156 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse159 (div .cse157 50))) (let ((.cse158 (mod .cse159 29))) (and (= (mod (div .cse157 10) 5) 0) (<= .cse158 .cse2) (= 0 .cse158) (= (mod .cse157 10) 0) (not (< (+ .cse159 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse161 (* 9 v_~a29~0_899))) (let ((.cse160 (div .cse161 50))) (and (<= (mod .cse160 29) .cse2) (<= 0 .cse160) (= (mod .cse161 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse164 (* 9 v_~a29~0_899))) (let ((.cse165 (+ (div .cse164 10) 1))) (let ((.cse162 (div .cse164 50)) (.cse166 (div .cse165 5))) (let ((.cse167 (mod (+ .cse166 1) 29)) (.cse163 (+ .cse162 1))) (and (not (= 0 (mod .cse162 29))) (not (= (mod .cse163 29) 0)) (not (= (mod .cse164 10) 0)) (not (= (mod .cse165 5) 0)) (not (= (mod .cse166 29) 0)) (<= .cse167 .cse6) (not (= .cse167 0)) (< .cse163 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse168 (* 9 v_~a29~0_899))) (let ((.cse169 (div .cse168 50))) (and (= (mod (div .cse168 10) 5) 0) (<= (mod .cse169 29) .cse2) (<= 0 .cse169))))))) is different from true [2022-12-13 17:11:07,064 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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse19 50))) (let ((.cse20 (+ .cse16 1))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 (mod .cse16 29))) (not (= .cse17 0)) (not (= (mod .cse18 5) 0)) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< .cse20 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (div (+ .cse21 1) 5))) (and (= (mod .cse21 5) 0) (= (mod .cse22 29) 0) (<= (mod (div .cse23 50) 29) .cse2) (= (mod .cse23 10) 0) (<= 0 (+ .cse22 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (div (+ .cse24 1) 5))) (and (= (mod .cse24 5) 0) (= (mod .cse25 29) 0) (<= (mod (div .cse26 50) 29) .cse2) (<= 0 (+ .cse25 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (+ (div .cse28 10) 1))) (and (<= (mod (div .cse27 5) 29) .cse2) (< .cse28 0) (= (mod .cse27 5) 0) (not (< (+ (div .cse28 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse29 50))) (let ((.cse30 (mod .cse31 29))) (and (= (mod (div (+ (div .cse29 10) 1) 5) 29) 0) (<= .cse30 .cse2) (= 0 .cse30) (= (mod .cse29 10) 0) (not (< (+ .cse31 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse35 (* 9 v_~a29~0_899))) (let ((.cse33 (div .cse35 50))) (let ((.cse32 (div (+ (div .cse35 10) 1) 5)) (.cse34 (+ .cse33 1))) (and (not (= (mod .cse32 29) 0)) (= 0 (mod .cse33 29)) (<= (mod .cse34 29) .cse6) (= (mod .cse35 10) 0) (not (= (mod (+ .cse32 1) 29) 0)) (< .cse34 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (div (* 9 v_~a29~0_899) 50))) (let ((.cse36 (mod .cse37 29))) (and (<= .cse36 .cse2) (= 0 .cse36) (not (< (+ .cse37 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse40 50)) (.cse39 (div (+ (div .cse40 10) 1) 5))) (and (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (= (mod (+ .cse39 1) 29) 0) (= (mod .cse40 10) 0) (not (< .cse39 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 10))) (let ((.cse43 (div (+ .cse41 1) 5))) (and (= (mod .cse41 5) 0) (<= (mod (div .cse42 50) 29) .cse2) (= (mod (+ .cse43 1) 29) 0) (not (< .cse43 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse46 50)) (.cse45 (div (+ (div .cse46 10) 1) 5))) (and (= (mod (+ .cse44 1) 29) 0) (<= (mod .cse44 29) .cse2) (= (mod (+ .cse45 1) 29) 0) (not (< .cse45 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse47 (div (+ (div .cse48 10) 1) 5))) (and (= (mod .cse47 29) 0) (<= (mod (div .cse48 50) 29) .cse2) (= (mod .cse48 10) 0) (<= 0 (+ .cse47 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse50 50))) (and (= (mod (+ .cse49 1) 29) 0) (<= (mod .cse49 29) .cse2) (not (< (div .cse50 10) 0)) (= (mod .cse50 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse53 50)) (.cse51 (div .cse53 10))) (and (= (mod (div (+ .cse51 1) 5) 29) 0) (= (mod (+ .cse52 1) 29) 0) (<= (mod .cse52 29) .cse2) (not (< .cse51 0)) (= (mod .cse53 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse54 50))) (let ((.cse55 (mod .cse56 29))) (and (= (mod (div (+ (div .cse54 10) 1) 5) 29) 0) (<= .cse55 .cse2) (= 0 .cse55) (not (< (+ .cse56 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse59 (div .cse57 5))) (let ((.cse58 (+ .cse59 1))) (and (not (= (mod .cse57 5) 0)) (not (< .cse58 0)) (< .cse59 0) (<= (mod .cse58 29) .cse2)))))) (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) .cse6) (= (mod .cse62 10) 0) (< .cse61 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse63 (div (+ (div .cse64 10) 1) 5)) (.cse65 (div .cse64 50))) (and (= (mod .cse63 29) 0) (not (= (mod .cse64 10) 0)) (<= (mod (+ .cse63 1) 29) .cse6) (= 0 (mod .cse65 29)) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse66 50))) (and (= (mod (div .cse66 10) 5) 0) (<= (mod .cse67 29) .cse2) (<= 0 .cse67) (= (mod .cse66 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse68 50))) (and (= (mod (div .cse68 10) 5) 0) (= (mod (+ .cse69 1) 29) 0) (<= (mod .cse69 29) .cse2) (not (< .cse69 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse71 (+ (div .cse70 10) 1)) (.cse72 (div .cse70 50))) (and (not (= (mod .cse70 10) 0)) (<= (mod (div .cse71 5) 29) .cse6) (= 0 (mod .cse72 29)) (= (mod .cse71 5) 0) (< (+ .cse72 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (<= (mod .cse73 29) .cse2) (= (mod (+ (div (+ (div .cse74 10) 1) 5) 1) 29) 0) (<= 0 .cse73))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ (div .cse76 10) 1) 5) 1) 29) 0) (<= 0 .cse75) (= (mod .cse76 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse79 (div (+ (div .cse77 10) 1) 5))) (let ((.cse78 (mod (+ .cse79 1) 29))) (and (= (mod (+ (div .cse77 50) 1) 29) 0) (not (= (mod .cse77 10) 0)) (= .cse78 0) (< .cse79 0) (<= .cse78 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse81 50))) (and (= (mod (+ .cse80 1) 29) 0) (<= (mod .cse80 29) .cse2) (not (< (div .cse81 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse84 10)) (.cse83 (div .cse84 50))) (and (= (mod .cse82 5) 0) (<= (mod .cse83 29) .cse2) (= (mod (+ (div (+ .cse82 1) 5) 1) 29) 0) (<= 0 .cse83))))) (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 ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse101 10))) (let ((.cse100 (div (+ .cse99 1) 5)) (.cse98 (mod (+ (div .cse101 50) 1) 29))) (and (= .cse98 0) (not (= (mod .cse99 5) 0)) (= (mod (+ .cse100 1) 29) 0) (= (mod .cse101 10) 0) (< .cse100 0) (<= .cse98 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse102 50))) (let ((.cse103 (mod .cse104 29))) (and (= (mod (div .cse102 10) 5) 0) (<= .cse103 .cse2) (= 0 .cse103) (= (mod .cse102 10) 0) (< (+ .cse104 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.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))) (and (= (mod (div .cse112 10) 5) 0) (= (mod (+ .cse113 1) 29) 0) (<= (mod .cse113 29) .cse2) (not (< .cse113 0)) (= (mod .cse112 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse115 (div (+ (div .cse116 10) 1) 5))) (let ((.cse114 (mod .cse115 29))) (and (= .cse114 0) (not (< (+ .cse115 1) 0)) (<= .cse114 .cse2) (< .cse116 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse118 (* 9 v_~a29~0_899))) (let ((.cse117 (div (+ (div .cse118 10) 1) 5))) (and (< .cse117 0) (<= (mod (+ .cse117 1) 29) .cse2) (not (< (+ (div .cse118 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse121 (+ (div .cse119 10) 1))) (let ((.cse120 (div .cse121 5))) (and (= (mod (+ (div .cse119 50) 1) 29) 0) (not (= (mod .cse119 10) 0)) (< (+ .cse120 1) 0) (<= (mod .cse120 29) .cse2) (= (mod .cse121 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse122 (div (+ (div .cse123 10) 1) 5))) (and (not (< (+ .cse122 1) 0)) (<= (mod .cse122 29) .cse6) (< (+ (div .cse123 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse124 (+ (div .cse126 10) 1))) (let ((.cse125 (div .cse124 5))) (and (not (= (mod .cse124 5) 0)) (not (= (mod .cse125 29) 0)) (<= (mod (+ .cse125 1) 29) .cse6) (= 0 (mod (div .cse126 50) 29))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse127 (div .cse130 50))) (let ((.cse129 (div (+ (div .cse130 10) 1) 5)) (.cse128 (+ .cse127 1))) (and (not (= 0 (mod .cse127 29))) (not (= (mod .cse128 29) 0)) (= (mod .cse129 29) 0) (not (= (mod .cse130 10) 0)) (<= (mod (+ .cse129 1) 29) .cse6) (< .cse128 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse134 10))) (let ((.cse132 (div (+ .cse131 1) 5)) (.cse133 (div .cse134 50))) (and (= (mod .cse131 5) 0) (not (= (mod .cse132 29) 0)) (<= (mod .cse133 29) .cse6) (= (mod .cse134 10) 0) (not (= (mod (+ .cse132 1) 29) 0)) (< (+ .cse133 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 50)) (.cse135 (div .cse137 10))) (and (= (mod (div (+ .cse135 1) 5) 29) 0) (= (mod (+ .cse136 1) 29) 0) (<= (mod .cse136 29) .cse2) (not (< .cse135 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse139 10))) (let ((.cse140 (div (+ .cse138 1) 5))) (and (= (mod .cse138 5) 0) (<= (mod (div .cse139 50) 29) .cse2) (= (mod (+ .cse140 1) 29) 0) (= (mod .cse139 10) 0) (not (< .cse140 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse141 (div .cse143 10)) (.cse142 (div .cse143 50))) (and (= (mod .cse141 5) 0) (<= (mod .cse142 29) .cse2) (= (mod (+ (div (+ .cse141 1) 5) 1) 29) 0) (<= 0 .cse142) (= (mod .cse143 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (+ (div .cse145 10) 1))) (and (not (< .cse144 0)) (<= (mod (div .cse144 5) 29) .cse2) (< .cse145 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse146 50))) (let ((.cse147 (mod .cse148 29))) (and (= (mod (div .cse146 10) 5) 0) (<= .cse147 .cse2) (= 0 .cse147) (= (mod .cse146 10) 0) (not (< (+ .cse148 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse150 50))) (and (<= (mod .cse149 29) .cse2) (<= 0 .cse149) (= (mod .cse150 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse153 (* 9 v_~a29~0_899))) (let ((.cse154 (+ (div .cse153 10) 1))) (let ((.cse151 (div .cse153 50)) (.cse155 (div .cse154 5))) (let ((.cse156 (mod (+ .cse155 1) 29)) (.cse152 (+ .cse151 1))) (and (not (= 0 (mod .cse151 29))) (not (= (mod .cse152 29) 0)) (not (= (mod .cse153 10) 0)) (not (= (mod .cse154 5) 0)) (not (= (mod .cse155 29) 0)) (<= .cse156 .cse6) (not (= .cse156 0)) (< .cse152 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse157 (* 9 v_~a29~0_899))) (let ((.cse158 (div .cse157 50))) (and (= (mod (div .cse157 10) 5) 0) (<= (mod .cse158 29) .cse2) (<= 0 .cse158))))))) is different from true [2022-12-13 17:11:49,829 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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse19 50))) (let ((.cse20 (+ .cse16 1))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 (mod .cse16 29))) (not (= .cse17 0)) (not (= (mod .cse18 5) 0)) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< .cse20 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (div (+ .cse21 1) 5))) (and (= (mod .cse21 5) 0) (= (mod .cse22 29) 0) (<= (mod (div .cse23 50) 29) .cse2) (= (mod .cse23 10) 0) (<= 0 (+ .cse22 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (div (+ .cse24 1) 5))) (and (= (mod .cse24 5) 0) (= (mod .cse25 29) 0) (<= (mod (div .cse26 50) 29) .cse2) (<= 0 (+ .cse25 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (+ (div .cse28 10) 1))) (and (<= (mod (div .cse27 5) 29) .cse2) (< .cse28 0) (= (mod .cse27 5) 0) (not (< (+ (div .cse28 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse29 50))) (let ((.cse30 (mod .cse31 29))) (and (= (mod (div (+ (div .cse29 10) 1) 5) 29) 0) (<= .cse30 .cse2) (= 0 .cse30) (= (mod .cse29 10) 0) (not (< (+ .cse31 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (div (* 9 v_~a29~0_899) 50))) (let ((.cse32 (mod .cse33 29))) (and (<= .cse32 .cse2) (= 0 .cse32) (not (< (+ .cse33 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse36 50)) (.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (= (mod (+ .cse35 1) 29) 0) (= (mod .cse36 10) 0) (not (< .cse35 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 10))) (let ((.cse39 (div (+ .cse37 1) 5))) (and (= (mod .cse37 5) 0) (<= (mod (div .cse38 50) 29) .cse2) (= (mod (+ .cse39 1) 29) 0) (not (< .cse39 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse40 (div .cse42 50)) (.cse41 (div (+ (div .cse42 10) 1) 5))) (and (= (mod (+ .cse40 1) 29) 0) (<= (mod .cse40 29) .cse2) (= (mod (+ .cse41 1) 29) 0) (not (< .cse41 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse43 (div (+ (div .cse44 10) 1) 5))) (and (= (mod .cse43 29) 0) (<= (mod (div .cse44 50) 29) .cse2) (= (mod .cse44 10) 0) (<= 0 (+ .cse43 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse45 (div .cse46 50))) (and (= (mod (+ .cse45 1) 29) 0) (<= (mod .cse45 29) .cse2) (not (< (div .cse46 10) 0)) (= (mod .cse46 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse49 50)) (.cse47 (div .cse49 10))) (and (= (mod (div (+ .cse47 1) 5) 29) 0) (= (mod (+ .cse48 1) 29) 0) (<= (mod .cse48 29) .cse2) (not (< .cse47 0)) (= (mod .cse49 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse50 50))) (let ((.cse51 (mod .cse52 29))) (and (= (mod (div (+ (div .cse50 10) 1) 5) 29) 0) (<= .cse51 .cse2) (= 0 .cse51) (not (< (+ .cse52 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse55 (div .cse53 5))) (let ((.cse54 (+ .cse55 1))) (and (not (= (mod .cse53 5) 0)) (not (< .cse54 0)) (< .cse55 0) (<= (mod .cse54 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse58 10))) (let ((.cse57 (div (+ .cse56 1) 5))) (and (= (mod .cse56 5) 0) (= (mod (+ .cse57 1) 29) 0) (<= (mod (div .cse58 50) 29) .cse6) (= (mod .cse58 10) 0) (< .cse57 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse59 (div (+ (div .cse60 10) 1) 5)) (.cse61 (div .cse60 50))) (and (= (mod .cse59 29) 0) (not (= (mod .cse60 10) 0)) (<= (mod (+ .cse59 1) 29) .cse6) (= 0 (mod .cse61 29)) (< (+ .cse61 1) 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) .cse6) (= 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 ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse81 50))) (and (= (mod (div (+ (div .cse81 10) 1) 5) 29) 0) (<= (mod .cse82 29) .cse2) (<= 0 .cse82))))) (exists ((v_~a29~0_899 Int)) (let ((.cse85 (* 9 v_~a29~0_899))) (let ((.cse83 (div .cse85 50)) (.cse84 (div (+ (div .cse85 10) 1) 5))) (and (not (= 0 (mod .cse83 29))) (not (= (mod (+ .cse83 1) 29) 0)) (= (mod .cse84 29) 0) (not (= (mod .cse85 10) 0)) (<= (mod (+ .cse84 1) 29) .cse6))))) (exists ((v_~a29~0_899 Int)) (let ((.cse86 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse86 50))) (let ((.cse87 (mod .cse88 29))) (and (= (mod (div .cse86 10) 5) 0) (<= .cse87 .cse2) (= 0 .cse87) (not (< (+ .cse88 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse89 (div (+ (div .cse90 10) 1) 5))) (and (<= 0 .cse89) (<= (mod .cse89 29) .cse2) (< .cse90 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (* 9 v_~a29~0_899))) (let ((.cse91 (div .cse93 10)) (.cse92 (mod (+ (div .cse93 50) 1) 29))) (and (= (mod (div (+ .cse91 1) 5) 29) 0) (= .cse92 0) (= (mod .cse93 10) 0) (< .cse91 0) (<= .cse92 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse95 (* 9 v_~a29~0_899))) (let ((.cse94 (mod (div (+ (div .cse95 10) 1) 5) 29))) (and (= .cse94 0) (<= .cse94 .cse2) (< .cse95 0) (not (< (+ (div .cse95 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse96 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse96 29) .cse2) (<= 0 .cse96)))) (exists ((v_~a29~0_899 Int)) (let ((.cse100 (* 9 v_~a29~0_899))) (let ((.cse98 (div .cse100 10))) (let ((.cse99 (div (+ .cse98 1) 5)) (.cse97 (mod (+ (div .cse100 50) 1) 29))) (and (= .cse97 0) (not (= (mod .cse98 5) 0)) (= (mod (+ .cse99 1) 29) 0) (= (mod .cse100 10) 0) (< .cse99 0) (<= .cse97 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse103 (div .cse101 50))) (let ((.cse102 (mod .cse103 29))) (and (= (mod (div .cse101 10) 5) 0) (<= .cse102 .cse2) (= 0 .cse102) (= (mod .cse101 10) 0) (< (+ .cse103 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse105 (* 9 v_~a29~0_899))) (let ((.cse106 (+ (div .cse105 10) 1))) (let ((.cse107 (div .cse106 5))) (let ((.cse108 (mod (+ .cse107 1) 29)) (.cse104 (div .cse105 50))) (and (not (= 0 (mod .cse104 29))) (not (= (mod .cse105 10) 0)) (not (= (mod .cse106 5) 0)) (not (= (mod .cse107 29) 0)) (<= .cse108 .cse6) (not (= .cse108 0)) (< (+ .cse104 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse112 (* 9 v_~a29~0_899))) (let ((.cse110 (div .cse112 50))) (let ((.cse109 (div .cse112 10)) (.cse111 (+ .cse110 1))) (and (= (mod (div (+ .cse109 1) 5) 29) 0) (not (= (mod .cse109 5) 0)) (= 0 (mod .cse110 29)) (<= (mod .cse111 29) .cse6) (= (mod .cse112 10) 0) (< .cse111 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse114 (* 9 v_~a29~0_899))) (let ((.cse115 (div .cse114 50))) (let ((.cse113 (mod .cse115 29))) (and (<= .cse113 .cse2) (= 0 .cse113) (= (mod .cse114 10) 0) (not (< (+ .cse115 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse116 50))) (let ((.cse118 (+ .cse117 1))) (and (not (= (mod (div (+ (div .cse116 10) 1) 5) 29) 0)) (= 0 (mod .cse117 29)) (<= (mod .cse118 29) .cse6) (= (mod .cse116 10) 0) (< .cse118 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 ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse128 (+ (div .cse126 10) 1))) (let ((.cse127 (div .cse128 5))) (and (= (mod (+ (div .cse126 50) 1) 29) 0) (not (= (mod .cse126 10) 0)) (< (+ .cse127 1) 0) (<= (mod .cse127 29) .cse2) (= (mod .cse128 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse129 (div (+ (div .cse130 10) 1) 5))) (and (not (< (+ .cse129 1) 0)) (<= (mod .cse129 29) .cse6) (< (+ (div .cse130 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse134 (* 9 v_~a29~0_899))) (let ((.cse131 (div .cse134 10))) (let ((.cse132 (div (+ .cse131 1) 5)) (.cse133 (div .cse134 50))) (and (= (mod .cse131 5) 0) (not (= (mod .cse132 29) 0)) (<= (mod .cse133 29) .cse6) (= (mod .cse134 10) 0) (not (= (mod (+ .cse132 1) 29) 0)) (< (+ .cse133 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse137 (* 9 v_~a29~0_899))) (let ((.cse136 (div .cse137 50)) (.cse135 (div .cse137 10))) (and (= (mod (div (+ .cse135 1) 5) 29) 0) (= (mod (+ .cse136 1) 29) 0) (<= (mod .cse136 29) .cse2) (not (< .cse135 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse138 (div .cse139 10))) (let ((.cse140 (div (+ .cse138 1) 5))) (and (= (mod .cse138 5) 0) (<= (mod (div .cse139 50) 29) .cse2) (= (mod (+ .cse140 1) 29) 0) (= (mod .cse139 10) 0) (not (< .cse140 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse143 (* 9 v_~a29~0_899))) (let ((.cse141 (div .cse143 10)) (.cse142 (div .cse143 50))) (and (= (mod .cse141 5) 0) (<= (mod .cse142 29) .cse2) (= (mod (+ (div (+ .cse141 1) 5) 1) 29) 0) (<= 0 .cse142) (= (mod .cse143 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse145 (* 9 v_~a29~0_899))) (let ((.cse144 (+ (div .cse145 10) 1))) (and (not (< .cse144 0)) (<= (mod (div .cse144 5) 29) .cse2) (< .cse145 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse146 50))) (let ((.cse147 (mod .cse148 29))) (and (= (mod (div .cse146 10) 5) 0) (<= .cse147 .cse2) (= 0 .cse147) (= (mod .cse146 10) 0) (not (< (+ .cse148 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse150 (* 9 v_~a29~0_899))) (let ((.cse149 (div .cse150 50))) (and (<= (mod .cse149 29) .cse2) (<= 0 .cse149) (= (mod .cse150 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse151 (* 9 v_~a29~0_899))) (let ((.cse152 (div .cse151 50))) (and (= (mod (div .cse151 10) 5) 0) (<= (mod .cse152 29) .cse2) (<= 0 .cse152))))))) is different from true [2022-12-13 17:12:30,134 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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse19 50))) (let ((.cse20 (+ .cse16 1))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 (mod .cse16 29))) (not (= .cse17 0)) (not (= (mod .cse18 5) 0)) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< .cse20 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (div (+ .cse21 1) 5))) (and (= (mod .cse21 5) 0) (= (mod .cse22 29) 0) (<= (mod (div .cse23 50) 29) .cse2) (= (mod .cse23 10) 0) (<= 0 (+ .cse22 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse26 (* 9 v_~a29~0_899))) (let ((.cse24 (div .cse26 10))) (let ((.cse25 (div (+ .cse24 1) 5))) (and (= (mod .cse24 5) 0) (= (mod .cse25 29) 0) (<= (mod (div .cse26 50) 29) .cse2) (<= 0 (+ .cse25 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse28 (* 9 v_~a29~0_899))) (let ((.cse27 (+ (div .cse28 10) 1))) (and (<= (mod (div .cse27 5) 29) .cse2) (< .cse28 0) (= (mod .cse27 5) 0) (not (< (+ (div .cse28 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (let ((.cse31 (div .cse29 50))) (let ((.cse30 (mod .cse31 29))) (and (= (mod (div (+ (div .cse29 10) 1) 5) 29) 0) (<= .cse30 .cse2) (= 0 .cse30) (= (mod .cse29 10) 0) (not (< (+ .cse31 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (div (* 9 v_~a29~0_899) 50))) (let ((.cse32 (mod .cse33 29))) (and (<= .cse32 .cse2) (= 0 .cse32) (not (< (+ .cse33 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse36 (* 9 v_~a29~0_899))) (let ((.cse34 (div .cse36 50)) (.cse35 (div (+ (div .cse36 10) 1) 5))) (and (= (mod (+ .cse34 1) 29) 0) (<= (mod .cse34 29) .cse2) (= (mod (+ .cse35 1) 29) 0) (= (mod .cse36 10) 0) (not (< .cse35 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse38 (* 9 v_~a29~0_899))) (let ((.cse37 (div .cse38 10))) (let ((.cse39 (div (+ .cse37 1) 5))) (and (= (mod .cse37 5) 0) (<= (mod (div .cse38 50) 29) .cse2) (= (mod (+ .cse39 1) 29) 0) (not (< .cse39 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse40 (div .cse42 50)) (.cse41 (div (+ (div .cse42 10) 1) 5))) (and (= (mod (+ .cse40 1) 29) 0) (<= (mod .cse40 29) .cse2) (= (mod (+ .cse41 1) 29) 0) (not (< .cse41 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse44 (* 9 v_~a29~0_899))) (let ((.cse43 (div (+ (div .cse44 10) 1) 5))) (and (= (mod .cse43 29) 0) (<= (mod (div .cse44 50) 29) .cse2) (= (mod .cse44 10) 0) (<= 0 (+ .cse43 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse45 (div .cse46 50))) (and (= (mod (+ .cse45 1) 29) 0) (<= (mod .cse45 29) .cse2) (not (< (div .cse46 10) 0)) (= (mod .cse46 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse49 (* 9 v_~a29~0_899))) (let ((.cse48 (div .cse49 50)) (.cse47 (div .cse49 10))) (and (= (mod (div (+ .cse47 1) 5) 29) 0) (= (mod (+ .cse48 1) 29) 0) (<= (mod .cse48 29) .cse2) (not (< .cse47 0)) (= (mod .cse49 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse50 50))) (let ((.cse51 (mod .cse52 29))) (and (= (mod (div (+ (div .cse50 10) 1) 5) 29) 0) (<= .cse51 .cse2) (= 0 .cse51) (not (< (+ .cse52 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse55 (div .cse53 5))) (let ((.cse54 (+ .cse55 1))) (and (not (= (mod .cse53 5) 0)) (not (< .cse54 0)) (< .cse55 0) (<= (mod .cse54 29) .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse58 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse58 10))) (let ((.cse57 (div (+ .cse56 1) 5))) (and (= (mod .cse56 5) 0) (= (mod (+ .cse57 1) 29) 0) (<= (mod (div .cse58 50) 29) .cse6) (= (mod .cse58 10) 0) (< .cse57 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse60 (* 9 v_~a29~0_899))) (let ((.cse59 (div (+ (div .cse60 10) 1) 5)) (.cse61 (div .cse60 50))) (and (= (mod .cse59 29) 0) (not (= (mod .cse60 10) 0)) (<= (mod (+ .cse59 1) 29) .cse6) (= 0 (mod .cse61 29)) (< (+ .cse61 1) 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) .cse6) (= 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 ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse81 50))) (and (= (mod (div (+ (div .cse81 10) 1) 5) 29) 0) (<= (mod .cse82 29) .cse2) (<= 0 .cse82))))) (exists ((v_~a29~0_899 Int)) (let ((.cse83 (* 9 v_~a29~0_899))) (let ((.cse85 (div .cse83 50))) (let ((.cse84 (mod .cse85 29))) (and (= (mod (div .cse83 10) 5) 0) (<= .cse84 .cse2) (= 0 .cse84) (not (< (+ .cse85 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse87 (* 9 v_~a29~0_899))) (let ((.cse86 (div (+ (div .cse87 10) 1) 5))) (and (<= 0 .cse86) (<= (mod .cse86 29) .cse2) (< .cse87 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse90 (* 9 v_~a29~0_899))) (let ((.cse88 (div .cse90 10)) (.cse89 (mod (+ (div .cse90 50) 1) 29))) (and (= (mod (div (+ .cse88 1) 5) 29) 0) (= .cse89 0) (= (mod .cse90 10) 0) (< .cse88 0) (<= .cse89 .cse2))))) (exists ((v_~a29~0_899 Int)) (let ((.cse92 (* 9 v_~a29~0_899))) (let ((.cse91 (mod (div (+ (div .cse92 10) 1) 5) 29))) (and (= .cse91 0) (<= .cse91 .cse2) (< .cse92 0) (not (< (+ (div .cse92 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse93 (div (* 9 v_~a29~0_899) 50))) (and (<= (mod .cse93 29) .cse2) (<= 0 .cse93)))) (exists ((v_~a29~0_899 Int)) (let ((.cse97 (* 9 v_~a29~0_899))) (let ((.cse95 (div .cse97 10))) (let ((.cse96 (div (+ .cse95 1) 5)) (.cse94 (mod (+ (div .cse97 50) 1) 29))) (and (= .cse94 0) (not (= (mod .cse95 5) 0)) (= (mod (+ .cse96 1) 29) 0) (= (mod .cse97 10) 0) (< .cse96 0) (<= .cse94 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse98 (* 9 v_~a29~0_899))) (let ((.cse100 (div .cse98 50))) (let ((.cse99 (mod .cse100 29))) (and (= (mod (div .cse98 10) 5) 0) (<= .cse99 .cse2) (= 0 .cse99) (= (mod .cse98 10) 0) (< (+ .cse100 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse103 (+ (div .cse102 10) 1))) (let ((.cse104 (div .cse103 5))) (let ((.cse105 (mod (+ .cse104 1) 29)) (.cse101 (div .cse102 50))) (and (not (= 0 (mod .cse101 29))) (not (= (mod .cse102 10) 0)) (not (= (mod .cse103 5) 0)) (not (= (mod .cse104 29) 0)) (<= .cse105 .cse6) (not (= .cse105 0)) (< (+ .cse101 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse109 (* 9 v_~a29~0_899))) (let ((.cse107 (div .cse109 50))) (let ((.cse106 (div .cse109 10)) (.cse108 (+ .cse107 1))) (and (= (mod (div (+ .cse106 1) 5) 29) 0) (not (= (mod .cse106 5) 0)) (= 0 (mod .cse107 29)) (<= (mod .cse108 29) .cse6) (= (mod .cse109 10) 0) (< .cse108 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse111 (* 9 v_~a29~0_899))) (let ((.cse112 (div .cse111 50))) (let ((.cse110 (mod .cse112 29))) (and (<= .cse110 .cse2) (= 0 .cse110) (= (mod .cse111 10) 0) (not (< (+ .cse112 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse113 (* 9 v_~a29~0_899))) (let ((.cse114 (div .cse113 50))) (let ((.cse115 (+ .cse114 1))) (and (not (= (mod (div (+ (div .cse113 10) 1) 5) 29) 0)) (= 0 (mod .cse114 29)) (<= (mod .cse115 29) .cse6) (= (mod .cse113 10) 0) (< .cse115 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse116 (* 9 v_~a29~0_899))) (let ((.cse117 (div .cse116 50))) (and (= (mod (div .cse116 10) 5) 0) (= (mod (+ .cse117 1) 29) 0) (<= (mod .cse117 29) .cse2) (not (< .cse117 0)) (= (mod .cse116 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse120 (* 9 v_~a29~0_899))) (let ((.cse119 (div (+ (div .cse120 10) 1) 5))) (let ((.cse118 (mod .cse119 29))) (and (= .cse118 0) (not (< (+ .cse119 1) 0)) (<= .cse118 .cse2) (< .cse120 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse121 (div (+ (div .cse122 10) 1) 5))) (and (< .cse121 0) (<= (mod (+ .cse121 1) 29) .cse2) (not (< (+ (div .cse122 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse123 (* 9 v_~a29~0_899))) (let ((.cse125 (+ (div .cse123 10) 1))) (let ((.cse124 (div .cse125 5))) (and (= (mod (+ (div .cse123 50) 1) 29) 0) (not (= (mod .cse123 10) 0)) (< (+ .cse124 1) 0) (<= (mod .cse124 29) .cse2) (= (mod .cse125 5) 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 [2022-12-13 17:12:56,884 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 ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse8 (div .cse10 50)) (.cse12 (+ (div .cse10 10) 1))) (let ((.cse11 (div .cse12 5)) (.cse9 (+ .cse8 1))) (and (not (= 0 (mod .cse8 29))) (not (= (mod .cse9 29) 0)) (not (= (mod .cse10 10) 0)) (<= (mod .cse11 29) .cse6) (not (= (mod (+ .cse11 1) 29) 0)) (= (mod .cse12 5) 0) (< .cse9 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse13 (* 9 v_~a29~0_899))) (let ((.cse15 (+ (div .cse13 10) 1))) (let ((.cse14 (div .cse15 5))) (and (not (= (mod .cse13 10) 0)) (= (mod (+ .cse14 1) 29) 0) (<= (mod .cse14 29) .cse6) (= (mod .cse15 5) 0) (< (+ (div .cse13 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse19 (* 9 v_~a29~0_899))) (let ((.cse16 (div .cse19 50))) (let ((.cse20 (+ .cse16 1))) (let ((.cse17 (mod .cse20 29)) (.cse18 (div .cse19 10))) (and (not (= 0 (mod .cse16 29))) (not (= .cse17 0)) (not (= (mod .cse18 5) 0)) (<= .cse17 .cse6) (= (mod .cse19 10) 0) (not (= (mod (+ (div (+ .cse18 1) 5) 1) 29) 0)) (< .cse20 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse23 (* 9 v_~a29~0_899))) (let ((.cse21 (div .cse23 10))) (let ((.cse22 (div (+ .cse21 1) 5))) (and (= (mod .cse21 5) 0) (= (mod .cse22 29) 0) (<= (mod (div .cse23 50) 29) .cse2) (= (mod .cse23 10) 0) (<= 0 (+ .cse22 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse25 (* 9 v_~a29~0_899))) (let ((.cse26 (+ (div .cse25 10) 1))) (let ((.cse27 (mod (+ (div .cse26 5) 1) 29)) (.cse24 (div .cse25 50))) (and (not (= 0 (mod .cse24 29))) (not (= (mod .cse25 10) 0)) (not (= (mod .cse26 5) 0)) (<= .cse27 .cse6) (not (= .cse27 0)) (< (+ .cse24 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse30 (* 9 v_~a29~0_899))) (let ((.cse28 (div .cse30 10))) (let ((.cse29 (div (+ .cse28 1) 5))) (and (= (mod .cse28 5) 0) (= (mod .cse29 29) 0) (<= (mod (div .cse30 50) 29) .cse2) (<= 0 (+ .cse29 1))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (let ((.cse31 (+ (div .cse32 10) 1))) (and (<= (mod (div .cse31 5) 29) .cse2) (< .cse32 0) (= (mod .cse31 5) 0) (not (< (+ (div .cse32 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse33 (* 9 v_~a29~0_899))) (let ((.cse35 (div .cse33 50))) (let ((.cse34 (mod .cse35 29))) (and (= (mod (div (+ (div .cse33 10) 1) 5) 29) 0) (<= .cse34 .cse2) (= 0 .cse34) (= (mod .cse33 10) 0) (not (< (+ .cse35 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse37 (div (* 9 v_~a29~0_899) 50))) (let ((.cse36 (mod .cse37 29))) (and (<= .cse36 .cse2) (= 0 .cse36) (not (< (+ .cse37 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse40 (* 9 v_~a29~0_899))) (let ((.cse38 (div .cse40 50)) (.cse39 (div (+ (div .cse40 10) 1) 5))) (and (= (mod (+ .cse38 1) 29) 0) (<= (mod .cse38 29) .cse2) (= (mod (+ .cse39 1) 29) 0) (= (mod .cse40 10) 0) (not (< .cse39 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse42 (* 9 v_~a29~0_899))) (let ((.cse41 (div .cse42 10))) (let ((.cse43 (div (+ .cse41 1) 5))) (and (= (mod .cse41 5) 0) (<= (mod (div .cse42 50) 29) .cse2) (= (mod (+ .cse43 1) 29) 0) (not (< .cse43 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse46 (* 9 v_~a29~0_899))) (let ((.cse44 (div .cse46 50)) (.cse45 (div (+ (div .cse46 10) 1) 5))) (and (= (mod (+ .cse44 1) 29) 0) (<= (mod .cse44 29) .cse2) (= (mod (+ .cse45 1) 29) 0) (not (< .cse45 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse48 (* 9 v_~a29~0_899))) (let ((.cse47 (div (+ (div .cse48 10) 1) 5))) (and (= (mod .cse47 29) 0) (<= (mod (div .cse48 50) 29) .cse2) (= (mod .cse48 10) 0) (<= 0 (+ .cse47 1)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse50 (* 9 v_~a29~0_899))) (let ((.cse49 (div .cse50 50))) (and (= (mod (+ .cse49 1) 29) 0) (<= (mod .cse49 29) .cse2) (not (< (div .cse50 10) 0)) (= (mod .cse50 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse53 (* 9 v_~a29~0_899))) (let ((.cse52 (div .cse53 50)) (.cse51 (div .cse53 10))) (and (= (mod (div (+ .cse51 1) 5) 29) 0) (= (mod (+ .cse52 1) 29) 0) (<= (mod .cse52 29) .cse2) (not (< .cse51 0)) (= (mod .cse53 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse54 (* 9 v_~a29~0_899))) (let ((.cse56 (div .cse54 50))) (let ((.cse55 (mod .cse56 29))) (and (= (mod (div (+ (div .cse54 10) 1) 5) 29) 0) (<= .cse55 .cse2) (= 0 .cse55) (not (< (+ .cse56 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse57 (+ (div (* 9 v_~a29~0_899) 10) 1))) (let ((.cse59 (div .cse57 5))) (let ((.cse58 (+ .cse59 1))) (and (not (= (mod .cse57 5) 0)) (not (< .cse58 0)) (< .cse59 0) (<= (mod .cse58 29) .cse2)))))) (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) .cse6) (= (mod .cse62 10) 0) (< .cse61 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse64 (* 9 v_~a29~0_899))) (let ((.cse63 (div (+ (div .cse64 10) 1) 5)) (.cse65 (div .cse64 50))) (and (= (mod .cse63 29) 0) (not (= (mod .cse64 10) 0)) (<= (mod (+ .cse63 1) 29) .cse6) (= 0 (mod .cse65 29)) (< (+ .cse65 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse66 (* 9 v_~a29~0_899))) (let ((.cse67 (div .cse66 50))) (and (= (mod (div .cse66 10) 5) 0) (<= (mod .cse67 29) .cse2) (<= 0 .cse67) (= (mod .cse66 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse68 (* 9 v_~a29~0_899))) (let ((.cse69 (div .cse68 50))) (and (= (mod (div .cse68 10) 5) 0) (= (mod (+ .cse69 1) 29) 0) (<= (mod .cse69 29) .cse2) (not (< .cse69 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse70 (* 9 v_~a29~0_899))) (let ((.cse71 (+ (div .cse70 10) 1)) (.cse72 (div .cse70 50))) (and (not (= (mod .cse70 10) 0)) (<= (mod (div .cse71 5) 29) .cse6) (= 0 (mod .cse72 29)) (= (mod .cse71 5) 0) (< (+ .cse72 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse74 (* 9 v_~a29~0_899))) (let ((.cse73 (div .cse74 50))) (and (<= (mod .cse73 29) .cse2) (= (mod (+ (div (+ (div .cse74 10) 1) 5) 1) 29) 0) (<= 0 .cse73))))) (exists ((v_~a29~0_899 Int)) (let ((.cse76 (* 9 v_~a29~0_899))) (let ((.cse75 (div .cse76 50))) (and (<= (mod .cse75 29) .cse2) (= (mod (+ (div (+ (div .cse76 10) 1) 5) 1) 29) 0) (<= 0 .cse75) (= (mod .cse76 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse77 (* 9 v_~a29~0_899))) (let ((.cse79 (div (+ (div .cse77 10) 1) 5))) (let ((.cse78 (mod (+ .cse79 1) 29))) (and (= (mod (+ (div .cse77 50) 1) 29) 0) (not (= (mod .cse77 10) 0)) (= .cse78 0) (< .cse79 0) (<= .cse78 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse81 (* 9 v_~a29~0_899))) (let ((.cse80 (div .cse81 50))) (and (= (mod (+ .cse80 1) 29) 0) (<= (mod .cse80 29) .cse2) (not (< (div .cse81 10) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse84 (* 9 v_~a29~0_899))) (let ((.cse82 (div .cse84 10)) (.cse83 (div .cse84 50))) (and (= (mod .cse82 5) 0) (<= (mod .cse83 29) .cse2) (= (mod (+ (div (+ .cse82 1) 5) 1) 29) 0) (<= 0 .cse83))))) (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 ((.cse101 (* 9 v_~a29~0_899))) (let ((.cse99 (div .cse101 10))) (let ((.cse100 (div (+ .cse99 1) 5)) (.cse98 (mod (+ (div .cse101 50) 1) 29))) (and (= .cse98 0) (not (= (mod .cse99 5) 0)) (= (mod (+ .cse100 1) 29) 0) (= (mod .cse101 10) 0) (< .cse100 0) (<= .cse98 .cse2)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse102 (* 9 v_~a29~0_899))) (let ((.cse104 (div .cse102 50))) (let ((.cse103 (mod .cse104 29))) (and (= (mod (div .cse102 10) 5) 0) (<= .cse103 .cse2) (= 0 .cse103) (= (mod .cse102 10) 0) (< (+ .cse104 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.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 ((.cse115 (* 9 v_~a29~0_899))) (let ((.cse116 (div .cse115 50))) (and (= (mod (div .cse115 10) 5) 0) (= (mod (+ .cse116 1) 29) 0) (<= (mod .cse116 29) .cse2) (not (< .cse116 0)) (= (mod .cse115 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse119 (* 9 v_~a29~0_899))) (let ((.cse118 (div (+ (div .cse119 10) 1) 5))) (let ((.cse117 (mod .cse118 29))) (and (= .cse117 0) (not (< (+ .cse118 1) 0)) (<= .cse117 .cse2) (< .cse119 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse121 (* 9 v_~a29~0_899))) (let ((.cse120 (div (+ (div .cse121 10) 1) 5))) (and (< .cse120 0) (<= (mod (+ .cse120 1) 29) .cse2) (not (< (+ (div .cse121 50) 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse122 (* 9 v_~a29~0_899))) (let ((.cse124 (+ (div .cse122 10) 1))) (let ((.cse123 (div .cse124 5))) (and (= (mod (+ (div .cse122 50) 1) 29) 0) (not (= (mod .cse122 10) 0)) (< (+ .cse123 1) 0) (<= (mod .cse123 29) .cse2) (= (mod .cse124 5) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse126 (* 9 v_~a29~0_899))) (let ((.cse125 (div (+ (div .cse126 10) 1) 5))) (and (not (< (+ .cse125 1) 0)) (<= (mod .cse125 29) .cse6) (< (+ (div .cse126 50) 1) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse130 (* 9 v_~a29~0_899))) (let ((.cse127 (div .cse130 10))) (let ((.cse128 (div (+ .cse127 1) 5)) (.cse129 (div .cse130 50))) (and (= (mod .cse127 5) 0) (not (= (mod .cse128 29) 0)) (<= (mod .cse129 29) .cse6) (= (mod .cse130 10) 0) (not (= (mod (+ .cse128 1) 29) 0)) (< (+ .cse129 1) 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse133 (* 9 v_~a29~0_899))) (let ((.cse132 (div .cse133 50)) (.cse131 (div .cse133 10))) (and (= (mod (div (+ .cse131 1) 5) 29) 0) (= (mod (+ .cse132 1) 29) 0) (<= (mod .cse132 29) .cse2) (not (< .cse131 0)))))) (exists ((v_~a29~0_899 Int)) (let ((.cse135 (* 9 v_~a29~0_899))) (let ((.cse134 (div .cse135 10))) (let ((.cse136 (div (+ .cse134 1) 5))) (and (= (mod .cse134 5) 0) (<= (mod (div .cse135 50) 29) .cse2) (= (mod (+ .cse136 1) 29) 0) (= (mod .cse135 10) 0) (not (< .cse136 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse139 (* 9 v_~a29~0_899))) (let ((.cse137 (div .cse139 10)) (.cse138 (div .cse139 50))) (and (= (mod .cse137 5) 0) (<= (mod .cse138 29) .cse2) (= (mod (+ (div (+ .cse137 1) 5) 1) 29) 0) (<= 0 .cse138) (= (mod .cse139 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse141 (* 9 v_~a29~0_899))) (let ((.cse140 (+ (div .cse141 10) 1))) (and (not (< .cse140 0)) (<= (mod (div .cse140 5) 29) .cse2) (< .cse141 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse142 (* 9 v_~a29~0_899))) (let ((.cse144 (div .cse142 50))) (let ((.cse143 (mod .cse144 29))) (and (= (mod (div .cse142 10) 5) 0) (<= .cse143 .cse2) (= 0 .cse143) (= (mod .cse142 10) 0) (not (< (+ .cse144 1) 0))))))) (exists ((v_~a29~0_899 Int)) (let ((.cse146 (* 9 v_~a29~0_899))) (let ((.cse145 (div .cse146 50))) (and (<= (mod .cse145 29) .cse2) (<= 0 .cse145) (= (mod .cse146 10) 0))))) (exists ((v_~a29~0_899 Int)) (let ((.cse147 (* 9 v_~a29~0_899))) (let ((.cse148 (div .cse147 50))) (and (= (mod (div .cse147 10) 5) 0) (<= (mod .cse148 29) .cse2) (<= 0 .cse148))))))) is different from true