./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a --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 d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 --- 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-b5237d8 [2022-11-21 16:25:35,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:25:35,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:25:35,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:25:35,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:25:35,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:25:35,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:25:35,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:25:35,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:25:35,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:25:35,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:25:35,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:25:35,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:25:35,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:25:35,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:25:35,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:25:35,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:25:35,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:25:35,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:25:35,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:25:35,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:25:35,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:25:35,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:25:35,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:25:35,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:25:35,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:25:35,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:25:35,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:25:35,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:25:35,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:25:35,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:25:35,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:25:35,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:25:35,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:25:35,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:25:35,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:25:35,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:25:35,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:25:35,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:25:35,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:25:35,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:25:35,193 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:25:35,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:25:35,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:25:35,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:25:35,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:25:35,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:25:35,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:25:35,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:25:35,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:25:35,245 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:25:35,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:25:35,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:25:35,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:25:35,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:25:35,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:25:35,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:25:35,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:25:35,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:25:35,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:25:35,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:25:35,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:25:35,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:25:35,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:25:35,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:25:35,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:25:35,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:25:35,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:25:35,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:25:35,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:25:35,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:25:35,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:25:35,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:25:35,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:25:35,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:25:35,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/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_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a 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 -> d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 [2022-11-21 16:25:35,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:25:35,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:25:35,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:25:35,608 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:25:35,608 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:25:35,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-21 16:25:38,686 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:25:38,907 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:25:38,908 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-21 16:25:38,914 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/data/4fd609e3c/e5825bfc665f4a2cbfb66051ad5dab26/FLAG1b005dd37 [2022-11-21 16:25:38,942 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/data/4fd609e3c/e5825bfc665f4a2cbfb66051ad5dab26 [2022-11-21 16:25:38,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:25:38,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:25:38,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:25:38,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:25:38,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:25:38,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:25:38" (1/1) ... [2022-11-21 16:25:38,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b83861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:38, skipping insertion in model container [2022-11-21 16:25:38,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:25:38" (1/1) ... [2022-11-21 16:25:38,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:25:39,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:25:39,247 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_d59189d2-6367-45a1-9cb6-e172a778d9e5/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-21 16:25:39,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:25:39,272 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:25:39,290 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_d59189d2-6367-45a1-9cb6-e172a778d9e5/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-21 16:25:39,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:25:39,310 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:25:39,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39 WrapperNode [2022-11-21 16:25:39,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:25:39,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:25:39,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:25:39,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:25:39,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,343 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-21 16:25:39,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:25:39,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:25:39,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:25:39,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:25:39,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:25:39,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:25:39,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:25:39,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:25:39,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (1/1) ... [2022-11-21 16:25:39,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:25:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:39,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:25:39,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:25:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:25:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:25:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:25:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:25:39,551 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:25:39,553 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:25:39,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:25:39,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:25:39,732 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:25:39,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:25:39 BoogieIcfgContainer [2022-11-21 16:25:39,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:25:39,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:25:39,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:25:39,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:25:39,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:25:38" (1/3) ... [2022-11-21 16:25:39,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ea873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:25:39, skipping insertion in model container [2022-11-21 16:25:39,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:25:39" (2/3) ... [2022-11-21 16:25:39,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ea873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:25:39, skipping insertion in model container [2022-11-21 16:25:39,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:25:39" (3/3) ... [2022-11-21 16:25:39,770 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2022-11-21 16:25:39,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:25:39,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:25:39,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:25:39,885 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;@18c61dfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:25:39,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:25:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:25:39,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:39,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:25:39,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-21 16:25:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:39,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319076858] [2022-11-21 16:25:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:40,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319076858] [2022-11-21 16:25:40,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319076858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:25:40,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:25:40,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:25:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738742386] [2022-11-21 16:25:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:25:40,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:25:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:25:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:25:40,177 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:40,193 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-21 16:25:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:25:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 16:25:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:40,209 INFO L225 Difference]: With dead ends: 21 [2022-11-21 16:25:40,209 INFO L226 Difference]: Without dead ends: 9 [2022-11-21 16:25:40,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:25:40,219 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:40,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:25:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-21 16:25:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-21 16:25:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-21 16:25:40,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-21 16:25:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:40,253 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-21 16:25:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-21 16:25:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:25:40,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:40,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:25:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:25:40,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-21 16:25:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379373498] [2022-11-21 16:25:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379373498] [2022-11-21 16:25:40,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379373498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:25:40,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:25:40,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:25:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96289804] [2022-11-21 16:25:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:25:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:25:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:25:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:25:40,524 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:40,554 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-21 16:25:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:25:40,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 16:25:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:40,556 INFO L225 Difference]: With dead ends: 19 [2022-11-21 16:25:40,556 INFO L226 Difference]: Without dead ends: 12 [2022-11-21 16:25:40,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:25:40,558 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:40,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:25:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-21 16:25:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-21 16:25:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-21 16:25:40,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-21 16:25:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:40,572 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-21 16:25:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-21 16:25:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:25:40,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:40,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:40,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:25:40,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-21 16:25:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:40,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371039309] [2022-11-21 16:25:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:40,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371039309] [2022-11-21 16:25:40,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371039309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:40,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109328211] [2022-11-21 16:25:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:40,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:40,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:40,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:40,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:25:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:40,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 16:25:40,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:41,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:25:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:41,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109328211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:25:41,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:25:41,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-21 16:25:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561900419] [2022-11-21 16:25:41,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:25:41,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:25:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:25:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:25:41,261 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:41,605 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-21 16:25:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:25:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 9 [2022-11-21 16:25:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:41,608 INFO L225 Difference]: With dead ends: 33 [2022-11-21 16:25:41,608 INFO L226 Difference]: Without dead ends: 22 [2022-11-21 16:25:41,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:25:41,610 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:41,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:25:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-21 16:25:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-11-21 16:25:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-21 16:25:41,617 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-11-21 16:25:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:41,617 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-21 16:25:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-21 16:25:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 16:25:41,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:41,623 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:41,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:25:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:41,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-21 16:25:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979597176] [2022-11-21 16:25:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:42,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979597176] [2022-11-21 16:25:42,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979597176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874723577] [2022-11-21 16:25:42,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:25:42,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:42,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:42,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:25:42,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:25:42,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:42,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:25:42,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 16:25:42,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:25:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874723577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:25:42,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:25:42,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-21 16:25:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049021447] [2022-11-21 16:25:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:25:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:25:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:25:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:25:42,514 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:42,597 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-11-21 16:25:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:25:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 18 [2022-11-21 16:25:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:42,602 INFO L225 Difference]: With dead ends: 30 [2022-11-21 16:25:42,603 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 16:25:42,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:25:42,606 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:42,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:25:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 16:25:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-21 16:25:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-21 16:25:42,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-21 16:25:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:42,626 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-21 16:25:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-21 16:25:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 16:25:42,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:42,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:42,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:25:42,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:42,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash 491841168, now seen corresponding path program 1 times [2022-11-21 16:25:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:42,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778365439] [2022-11-21 16:25:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:25:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:42,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778365439] [2022-11-21 16:25:42,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778365439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:42,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556057277] [2022-11-21 16:25:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:42,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:42,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:42,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:43,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:25:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:43,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:25:43,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:25:43,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:25:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:43,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556057277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:25:43,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:25:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 14 [2022-11-21 16:25:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232204585] [2022-11-21 16:25:43,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:25:43,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 16:25:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 16:25:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:25:43,481 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:45,709 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-11-21 16:25:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:25:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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 18 [2022-11-21 16:25:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:45,713 INFO L225 Difference]: With dead ends: 53 [2022-11-21 16:25:45,713 INFO L226 Difference]: Without dead ends: 43 [2022-11-21 16:25:45,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:25:45,715 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:45,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:25:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-21 16:25:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-21 16:25:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-21 16:25:45,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 18 [2022-11-21 16:25:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:45,742 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-21 16:25:45,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-21 16:25:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:25:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:45,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:45,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:25:45,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:45,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -191017413, now seen corresponding path program 2 times [2022-11-21 16:25:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137596503] [2022-11-21 16:25:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137596503] [2022-11-21 16:25:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137596503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441546909] [2022-11-21 16:25:46,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:25:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:46,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:46,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:25:46,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:25:46,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:46,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 16:25:46,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:25:46,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:25:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:25:46,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441546909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:25:46,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:25:46,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 21 [2022-11-21 16:25:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359674678] [2022-11-21 16:25:46,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:25:46,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-21 16:25:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-21 16:25:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:25:46,634 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:49,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:25:51,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:25:53,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:25:56,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:25:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:58,368 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2022-11-21 16:25:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 16:25:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 21 [2022-11-21 16:25:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:58,369 INFO L225 Difference]: With dead ends: 122 [2022-11-21 16:25:58,369 INFO L226 Difference]: Without dead ends: 97 [2022-11-21 16:25:58,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2022-11-21 16:25:58,371 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:58,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2022-11-21 16:25:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-21 16:25:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-11-21 16:25:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-11-21 16:25:58,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 21 [2022-11-21 16:25:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:58,389 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-11-21 16:25:58,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-11-21 16:25:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:25:58,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:58,391 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:58,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 16:25:58,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:58,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1978693868, now seen corresponding path program 3 times [2022-11-21 16:25:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393265704] [2022-11-21 16:25:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:25:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393265704] [2022-11-21 16:25:58,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393265704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821943570] [2022-11-21 16:25:58,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:25:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:58,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:58,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:25:58,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 16:25:58,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:58,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:25:58,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-21 16:25:58,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:25:58,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821943570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:25:58,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:25:58,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-21 16:25:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640157428] [2022-11-21 16:25:58,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:25:58,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:25:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:25:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:25:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:25:58,991 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:25:59,059 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-11-21 16:25:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:25:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 30 [2022-11-21 16:25:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:25:59,061 INFO L225 Difference]: With dead ends: 114 [2022-11-21 16:25:59,062 INFO L226 Difference]: Without dead ends: 110 [2022-11-21 16:25:59,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:25:59,063 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:25:59,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:25:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-21 16:25:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2022-11-21 16:25:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-11-21 16:25:59,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 30 [2022-11-21 16:25:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:25:59,082 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-11-21 16:25:59,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:25:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-11-21 16:25:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 16:25:59,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:25:59,083 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:25:59,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:25:59,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:59,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:25:59,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:25:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1598856071, now seen corresponding path program 4 times [2022-11-21 16:25:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:25:59,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858586920] [2022-11-21 16:25:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:25:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:25:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:25:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:25:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:25:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858586920] [2022-11-21 16:25:59,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858586920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:25:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430617485] [2022-11-21 16:25:59,504 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:25:59,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:25:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:25:59,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:25:59,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:25:59,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:25:59,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:25:59,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:25:59,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:25:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:25:59,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:26:00,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430617485] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:26:00,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:26:00,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-11-21 16:26:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535345754] [2022-11-21 16:26:00,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:26:00,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:26:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:26:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:26:00,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-11-21 16:26:00,065 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:26:03,890 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2022-11-21 16:26:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:26:03,891 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 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 33 [2022-11-21 16:26:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:26:03,891 INFO L225 Difference]: With dead ends: 101 [2022-11-21 16:26:03,891 INFO L226 Difference]: Without dead ends: 46 [2022-11-21 16:26:03,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=381, Invalid=611, Unknown=0, NotChecked=0, Total=992 [2022-11-21 16:26:03,893 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:26:03,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 16 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:26:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-21 16:26:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-21 16:26:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-11-21 16:26:03,906 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2022-11-21 16:26:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:26:03,907 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-11-21 16:26:03,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-11-21 16:26:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 16:26:03,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:26:03,908 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:26:03,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:26:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:26:04,114 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:26:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:26:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash 141362107, now seen corresponding path program 5 times [2022-11-21 16:26:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:26:04,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034143254] [2022-11-21 16:26:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:26:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:26:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:26:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 25 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:26:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034143254] [2022-11-21 16:26:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034143254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:26:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117870221] [2022-11-21 16:26:04,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:26:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:26:04,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:26:04,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:26:04,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:26:05,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-11-21 16:26:05,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:26:05,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 16:26:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:26:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:26:06,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:26:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:26:07,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117870221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:26:07,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:26:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 45 [2022-11-21 16:26:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796615325] [2022-11-21 16:26:07,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:26:07,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-21 16:26:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:26:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 16:26:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-11-21 16:26:07,183 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:26:09,637 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:26:56,463 WARN L233 SmtUtils]: Spent 27.67s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:26:58,658 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:27:37,993 WARN L233 SmtUtils]: Spent 24.14s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:27:40,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:28:07,933 WARN L233 SmtUtils]: Spent 18.79s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:28:09,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:28:34,447 WARN L233 SmtUtils]: Spent 16.30s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:29:13,777 WARN L233 SmtUtils]: Spent 16.19s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:29:18,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:20,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:23,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:25,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:27,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:29,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:31,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:33,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:35,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:37,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:39,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:29:56,359 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:29:58,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:00,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:02,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:04,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:06,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:08,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:10,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:12,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:22,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:24,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:27,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:29,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:31,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:36,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:38,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:41,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:43,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:30:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:30:49,097 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-11-21 16:30:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-21 16:30:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 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 45 [2022-11-21 16:30:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:30:49,098 INFO L225 Difference]: With dead ends: 160 [2022-11-21 16:30:49,099 INFO L226 Difference]: Without dead ends: 137 [2022-11-21 16:30:49,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 217.9s TimeCoverageRelationStatistics Valid=982, Invalid=4277, Unknown=13, NotChecked=580, Total=5852 [2022-11-21 16:30:49,101 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 49 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 65.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:30:49,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 244 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1260 Invalid, 26 Unknown, 12 Unchecked, 65.2s Time] [2022-11-21 16:30:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-21 16:30:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2022-11-21 16:30:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 111 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:30:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-11-21 16:30:49,130 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 45 [2022-11-21 16:30:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:30:49,131 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-11-21 16:30:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:30:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-11-21 16:30:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-21 16:30:49,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:30:49,133 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:30:49,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:30:49,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:49,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:30:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:30:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1567248470, now seen corresponding path program 6 times [2022-11-21 16:30:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:30:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087218991] [2022-11-21 16:30:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:30:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:30:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:30:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 109 proven. 260 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:30:49,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:30:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087218991] [2022-11-21 16:30:49,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087218991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:30:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070055997] [2022-11-21 16:30:49,835 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 16:30:49,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:49,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:30:49,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:30:49,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:30:49,945 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-21 16:30:49,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:30:49,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:30:49,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:30:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-21 16:30:50,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:30:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 149 proven. 75 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-21 16:30:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070055997] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:30:50,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:30:50,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 7] total 25 [2022-11-21 16:30:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279553192] [2022-11-21 16:30:50,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:30:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 16:30:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:30:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 16:30:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-11-21 16:30:50,547 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:30:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:30:52,074 INFO L93 Difference]: Finished difference Result 279 states and 366 transitions. [2022-11-21 16:30:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 16:30:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 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 54 [2022-11-21 16:30:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:30:52,077 INFO L225 Difference]: With dead ends: 279 [2022-11-21 16:30:52,077 INFO L226 Difference]: Without dead ends: 267 [2022-11-21 16:30:52,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=424, Invalid=1556, Unknown=0, NotChecked=0, Total=1980 [2022-11-21 16:30:52,079 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 113 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:30:52,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 47 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:30:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-21 16:30:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 160. [2022-11-21 16:30:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:30:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2022-11-21 16:30:52,120 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 54 [2022-11-21 16:30:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:30:52,120 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2022-11-21 16:30:52,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:30:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2022-11-21 16:30:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 16:30:52,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:30:52,123 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 16, 6, 1, 1, 1, 1, 1, 1] [2022-11-21 16:30:52,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:30:52,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:52,337 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:30:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:30:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -752211018, now seen corresponding path program 7 times [2022-11-21 16:30:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:30:52,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018833562] [2022-11-21 16:30:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:30:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:30:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:30:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 313 proven. 345 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-21 16:30:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:30:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018833562] [2022-11-21 16:30:52,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018833562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:30:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783808201] [2022-11-21 16:30:52,992 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-21 16:30:52,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:30:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:30:52,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:30:53,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:30:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:30:53,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 16:30:53,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:30:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:30:53,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:30:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:30:54,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783808201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:30:54,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:30:54,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 42 [2022-11-21 16:30:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961818367] [2022-11-21 16:30:54,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:30:54,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-21 16:30:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:30:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 16:30:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2022-11-21 16:30:54,843 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:32:29,389 INFO L93 Difference]: Finished difference Result 229 states and 287 transitions. [2022-11-21 16:32:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-21 16:32:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 0 states have call successors, (0), 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 72 [2022-11-21 16:32:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:32:29,391 INFO L225 Difference]: With dead ends: 229 [2022-11-21 16:32:29,391 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 16:32:29,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 95.0s TimeCoverageRelationStatistics Valid=1253, Invalid=2286, Unknown=1, NotChecked=0, Total=3540 [2022-11-21 16:32:29,394 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 165 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:32:29,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 64 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:32:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 16:32:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-21 16:32:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2022-11-21 16:32:29,448 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 72 [2022-11-21 16:32:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:32:29,449 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2022-11-21 16:32:29,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2022-11-21 16:32:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-21 16:32:29,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:32:29,452 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 38, 5, 1, 1, 1, 1, 1, 1] [2022-11-21 16:32:29,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-21 16:32:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 16:32:29,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:32:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:32:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1538427173, now seen corresponding path program 8 times [2022-11-21 16:32:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:32:29,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169511781] [2022-11-21 16:32:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:32:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:32:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:32:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 541 proven. 2185 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 16:32:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:32:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169511781] [2022-11-21 16:32:32,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169511781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:32:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785111143] [2022-11-21 16:32:32,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:32:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:32:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:32:32,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:32:32,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d59189d2-6367-45a1-9cb6-e172a778d9e5/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:32:32,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:32:32,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:32:32,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-21 16:32:32,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:32:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:32:35,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:32:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2712 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-21 16:32:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785111143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:32:41,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:32:41,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 52, 42] total 131 [2022-11-21 16:32:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291007365] [2022-11-21 16:32:41,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:32:41,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-21 16:32:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:32:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-21 16:32:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2287, Invalid=14743, Unknown=0, NotChecked=0, Total=17030 [2022-11-21 16:32:41,976 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 131 states, 131 states have (on average 2.885496183206107) internal successors, (378), 131 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:32:47,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:49,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:51,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:53,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:55,358 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:57,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:32:59,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:01,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:03,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:05,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:07,559 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:09,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:11,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:13,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:15,788 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:17,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:19,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:21,855 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:23,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:25,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:27,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:29,937 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:31,975 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:33,992 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:36,012 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:38,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:40,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:42,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:44,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:46,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:48,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:50,145 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:33:52,155 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:36:56,564 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:36:59,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:01,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:03,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:05,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:08,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:10,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:12,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:13,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:16,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:18,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:20,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:22,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:37:24,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:26,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:28,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:30,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:32,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:34,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:37:36,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:40:08,777 WARN L233 SmtUtils]: Spent 1.12m on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:40:10,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:40:12,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:40:14,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-21 16:40:16,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:40:18,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-21 16:40:20,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false