./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/jain_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/jain_5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:36:41,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:36:41,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:36:41,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:36:41,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:36:41,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:36:41,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:36:41,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:36:41,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:36:41,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:36:41,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:36:41,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:36:41,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:36:41,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:36:41,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:36:41,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:36:41,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:36:41,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:36:41,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:36:41,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:36:41,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:36:41,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:36:41,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:36:41,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:36:41,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:36:41,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:36:41,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:36:41,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:36:41,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:36:41,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:36:41,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:36:41,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:36:41,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:36:41,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:36:41,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:36:41,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:36:41,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:36:41,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:36:41,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:36:41,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:36:41,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:36:41,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:36:41,699 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:36:41,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:36:41,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:36:41,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:36:41,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:36:41,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:36:41,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:36:41,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:36:41,701 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:36:41,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:36:41,702 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:36:41,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:36:41,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:36:41,704 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:36:41,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:36:41,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:36:41,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:36:41,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:36:41,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:36:41,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:36:41,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:36:41,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:36:41,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:36:41,706 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 51f18e80b5b0f6da04af12e6407c1afb08dc9b5e98545aeafa4f330f4ac3434e [2021-12-17 02:36:41,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:36:41,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:36:41,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:36:41,906 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:36:41,906 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:36:41,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/jain_5-2.c [2021-12-17 02:36:41,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9657993/19f66d9441e4403596b6c9f1ad450e9d/FLAG6aa4b1588 [2021-12-17 02:36:42,330 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:36:42,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c [2021-12-17 02:36:42,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9657993/19f66d9441e4403596b6c9f1ad450e9d/FLAG6aa4b1588 [2021-12-17 02:36:42,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9657993/19f66d9441e4403596b6c9f1ad450e9d [2021-12-17 02:36:42,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:36:42,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:36:42,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:36:42,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:36:42,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:36:42,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a161f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42, skipping insertion in model container [2021-12-17 02:36:42,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:36:42,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:36:42,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2021-12-17 02:36:42,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:36:42,545 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:36:42,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c[665,678] [2021-12-17 02:36:42,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:36:42,564 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:36:42,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42 WrapperNode [2021-12-17 02:36:42,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:36:42,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:36:42,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:36:42,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:36:42,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,587 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2021-12-17 02:36:42,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:36:42,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:36:42,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:36:42,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:36:42,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:36:42,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:36:42,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:36:42,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:36:42,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (1/1) ... [2021-12-17 02:36:42,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:36:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:36:42,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 02:36:42,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 02:36:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:36:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:36:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:36:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:36:42,710 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:36:42,712 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:36:42,784 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:36:42,788 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:36:42,789 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 02:36:42,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:36:42 BoogieIcfgContainer [2021-12-17 02:36:42,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:36:42,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:36:42,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:36:42,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:36:42,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:36:42" (1/3) ... [2021-12-17 02:36:42,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b4c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:36:42, skipping insertion in model container [2021-12-17 02:36:42,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:36:42" (2/3) ... [2021-12-17 02:36:42,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b4c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:36:42, skipping insertion in model container [2021-12-17 02:36:42,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:36:42" (3/3) ... [2021-12-17 02:36:42,796 INFO L111 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2021-12-17 02:36:42,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:36:42,800 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:36:42,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:36:42,840 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:36:42,841 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:36:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-17 02:36:42,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:36:42,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-17 02:36:42,862 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:36:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:36:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2021-12-17 02:36:42,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:36:42,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493335979] [2021-12-17 02:36:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:36:42,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:36:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:36:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:43,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:36:43,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493335979] [2021-12-17 02:36:43,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493335979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:36:43,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:36:43,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:36:43,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837655732] [2021-12-17 02:36:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:36:43,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:36:43,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:36:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:36:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:36:43,103 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:36:43,133 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2021-12-17 02:36:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:36:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-17 02:36:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:36:43,140 INFO L225 Difference]: With dead ends: 18 [2021-12-17 02:36:43,141 INFO L226 Difference]: Without dead ends: 9 [2021-12-17 02:36:43,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:36:43,145 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:36:43,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:36:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-17 02:36:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-17 02:36:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) [2021-12-17 02:36:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-12-17 02:36:43,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2021-12-17 02:36:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:36:43,167 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-12-17 02:36:43,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-12-17 02:36:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 02:36:43,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:36:43,168 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-17 02:36:43,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:36:43,169 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:36:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:36:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 300686882, now seen corresponding path program 1 times [2021-12-17 02:36:43,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:36:43,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253944840] [2021-12-17 02:36:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:36:43,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:36:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:36:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:43,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:36:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253944840] [2021-12-17 02:36:43,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253944840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:36:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126379251] [2021-12-17 02:36:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:36:43,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:36:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:36:43,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:36:43,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 02:36:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:36:43,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 02:36:43,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:36:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:43,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:36:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:43,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126379251] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:36:43,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:36:43,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-17 02:36:43,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965243688] [2021-12-17 02:36:43,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:36:43,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:36:43,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:36:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:36:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:36:43,599 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:36:43,662 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-12-17 02:36:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:36:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 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 8 [2021-12-17 02:36:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:36:43,663 INFO L225 Difference]: With dead ends: 22 [2021-12-17 02:36:43,663 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 02:36:43,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-17 02:36:43,665 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:36:43,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:36:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 02:36:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-17 02:36:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-12-17 02:36:43,669 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2021-12-17 02:36:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:36:43,669 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-12-17 02:36:43,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-12-17 02:36:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 02:36:43,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:36:43,670 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2021-12-17 02:36:43,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 02:36:43,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:36:43,888 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:36:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:36:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1156434326, now seen corresponding path program 2 times [2021-12-17 02:36:43,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:36:43,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2437798] [2021-12-17 02:36:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:36:43,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:36:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:36:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:44,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:36:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2437798] [2021-12-17 02:36:44,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2437798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:36:44,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789249445] [2021-12-17 02:36:44,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:36:44,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:36:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:36:44,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:36:44,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 02:36:44,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:36:44,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:36:44,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 02:36:44,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:36:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:44,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:36:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:44,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789249445] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:36:44,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:36:44,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-12-17 02:36:44,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892767552] [2021-12-17 02:36:44,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:36:44,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 02:36:44,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:36:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 02:36:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-17 02:36:44,528 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:36:49,556 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-12-17 02:36:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 02:36:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 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 17 [2021-12-17 02:36:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:36:49,557 INFO L225 Difference]: With dead ends: 40 [2021-12-17 02:36:49,557 INFO L226 Difference]: Without dead ends: 38 [2021-12-17 02:36:49,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2021-12-17 02:36:49,558 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:36:49,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 63 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:36:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-17 02:36:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2021-12-17 02:36:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2021-12-17 02:36:49,563 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2021-12-17 02:36:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:36:49,563 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2021-12-17 02:36:49,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:36:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2021-12-17 02:36:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 02:36:49,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:36:49,577 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2021-12-17 02:36:49,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:36:49,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 02:36:49,793 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:36:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:36:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1353352554, now seen corresponding path program 3 times [2021-12-17 02:36:49,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:36:49,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131786212] [2021-12-17 02:36:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:36:49,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:36:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:36:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:49,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:36:49,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131786212] [2021-12-17 02:36:49,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131786212] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:36:49,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002557789] [2021-12-17 02:36:49,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:36:49,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:36:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:36:49,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:36:49,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 02:36:51,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-17 02:36:51,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:36:51,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-17 02:36:51,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:36:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:36:52,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:37:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:37:06,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002557789] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:37:06,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:37:06,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 38 [2021-12-17 02:37:06,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796279439] [2021-12-17 02:37:06,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:37:06,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 02:37:06,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:37:06,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 02:37:06,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1142, Unknown=1, NotChecked=0, Total=1406 [2021-12-17 02:37:06,578 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:37:08,833 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (.cse4 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (.cse6 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (.cse0 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (.cse2 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (.cse1 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (.cse7 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (not .cse4) (not .cse5) (or .cse5 (not .cse3)) (or .cse6 (not .cse7)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (or .cse4 (not .cse6)) (not .cse0) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) .cse2) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) .cse1) (or .cse7 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296)))))) is different from false [2021-12-17 02:37:10,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (.cse4 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (.cse6 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (.cse0 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (.cse2 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (.cse1 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296)))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (not .cse4) (not .cse5) (or .cse5 (not .cse3)) (or .cse6 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) (or .cse4 (not .cse6)) (not .cse0) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) .cse2) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) .cse1))) is different from false [2021-12-17 02:37:12,862 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (.cse3 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (.cse5 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (.cse0 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (.cse1 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296)))) (and (or .cse0 (not .cse1)) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) .cse2) (not .cse3) (not .cse4) (or .cse4 (not .cse2)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (or .cse5 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) (or .cse3 (not .cse5)) (or (= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not .cse0)) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) .cse1))) is different from false [2021-12-17 02:37:14,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse2 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (.cse3 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (.cse5 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (.cse0 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (.cse1 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296)))) (and (or .cse0 (not .cse1)) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) .cse2) (not .cse3) (not .cse4) (or .cse4 (not .cse2)) (or .cse5 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) (or .cse3 (not .cse5)) (not .cse0) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) .cse1))) is different from false [2021-12-17 02:37:16,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse1 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (.cse2 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (.cse4 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (.cse0 (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296)))) (and (or .cse0 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296)))) (or (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) .cse1) (not .cse2) (not .cse3) (or .cse3 (not .cse1)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (or .cse4 (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) (or .cse2 (not .cse4)) (or (= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not .cse0)))) is different from false [2021-12-17 02:38:42,399 WARN L227 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 62 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:38:44,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:46,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:48,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:50,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:52,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:54,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:56,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:38:58,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:39:00,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:05,173 WARN L227 SmtUtils]: Spent 51.70s on a formula simplification. DAG size of input: 60 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:40:07,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:09,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:11,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:28,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:30,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:32,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:34,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:36,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:38,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:40:40,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:41:27,171 WARN L227 SmtUtils]: Spent 34.86s on a formula simplification. DAG size of input: 49 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:41:29,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:41:54,499 WARN L227 SmtUtils]: Spent 16.53s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:42:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:42:14,412 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2021-12-17 02:42:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 02:42:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 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 35 [2021-12-17 02:42:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:42:14,414 INFO L225 Difference]: With dead ends: 73 [2021-12-17 02:42:14,414 INFO L226 Difference]: Without dead ends: 71 [2021-12-17 02:42:14,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 280.4s TimeCoverageRelationStatistics Valid=619, Invalid=2340, Unknown=31, NotChecked=550, Total=3540 [2021-12-17 02:42:14,416 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 125 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 56 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2021-12-17 02:42:14,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 193 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 320 Invalid, 20 Unknown, 7 Unchecked, 41.8s Time] [2021-12-17 02:42:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-17 02:42:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2021-12-17 02:42:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:42:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2021-12-17 02:42:14,429 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 35 [2021-12-17 02:42:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:42:14,429 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2021-12-17 02:42:14,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:42:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2021-12-17 02:42:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-17 02:42:14,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:42:14,433 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2021-12-17 02:42:14,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 02:42:14,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:42:14,659 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:42:14,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:42:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1882756062, now seen corresponding path program 4 times [2021-12-17 02:42:14,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:42:14,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693622051] [2021-12-17 02:42:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:42:14,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:42:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:42:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:42:15,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:42:15,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693622051] [2021-12-17 02:42:15,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693622051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:42:15,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079385363] [2021-12-17 02:42:15,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:42:15,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:42:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:42:15,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:42:15,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 02:42:15,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:42:15,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:42:15,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-17 02:42:15,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:42:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:42:16,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:42:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:42:17,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079385363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:42:17,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:42:17,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 69 [2021-12-17 02:42:17,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518819846] [2021-12-17 02:42:17,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:42:17,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-17 02:42:17,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:42:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-17 02:42:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=3935, Unknown=0, NotChecked=0, Total=4692 [2021-12-17 02:42:17,507 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:42:20,457 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 20) |c_ULTIMATE.start_main_~x~0#1| 760) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 22) |c_ULTIMATE.start_main_~x~0#1| 924) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 21) |c_ULTIMATE.start_main_~x~0#1| 840) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:22,465 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 20) |c_ULTIMATE.start_main_~x~0#1| 760) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 21) |c_ULTIMATE.start_main_~x~0#1| 840) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:24,475 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 20) |c_ULTIMATE.start_main_~x~0#1| 760) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:26,495 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 20) |c_ULTIMATE.start_main_~x~0#1| 760) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:28,503 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:30,512 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 19) |c_ULTIMATE.start_main_~x~0#1| 684) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:32,518 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:34,525 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 18) |c_ULTIMATE.start_main_~x~0#1| 612) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:36,533 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:38,540 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 17) |c_ULTIMATE.start_main_~x~0#1| 544) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:40,546 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:42,553 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 16) |c_ULTIMATE.start_main_~x~0#1| 480) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:44,560 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:46,568 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:48,576 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:50,589 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 14) |c_ULTIMATE.start_main_~x~0#1| 364) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:52,596 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:54,602 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 13) |c_ULTIMATE.start_main_~x~0#1| 312) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:56,609 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296)))) is different from false [2021-12-17 02:42:58,614 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 12) |c_ULTIMATE.start_main_~x~0#1| 264) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:00,621 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:02,634 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 11) |c_ULTIMATE.start_main_~x~0#1| 220) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:04,642 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:06,650 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:08,657 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:43:10,667 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 7) |c_ULTIMATE.start_main_~x~0#1| 84) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 3) |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 9) |c_ULTIMATE.start_main_~x~0#1| 144) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 6) |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 4) |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 8) |c_ULTIMATE.start_main_~x~0#1| 112) 4294967296))) (not (= 30 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 5) |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296)))) is different from false [2021-12-17 02:44:23,873 WARN L227 SmtUtils]: Spent 25.36s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:44:25,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:27,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:29,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:31,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:33,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:35,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:37,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:39,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:41,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:43,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:45,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:47,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:49,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:52,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:54,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:56,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:44:58,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:00,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:02,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:04,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:06,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:07,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:09,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:11,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:13,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:15,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:17,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:19,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:22,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:24,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:26,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:28,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:30,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:32,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:34,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:36,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:38,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:40,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:42,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:44,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:46,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:48,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:45:50,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:46:50,930 WARN L227 SmtUtils]: Spent 18.00s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:46:52,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:46:54,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:46:56,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:46:58,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:00,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:02,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:04,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:06,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:09,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:11,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:13,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:15,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:17,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:19,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:20,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:22,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:24,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:26,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:28,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:30,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:32,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:34,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:36,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:39,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:41,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:43,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:45,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:47,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:49,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:51,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:53,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:55,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:57,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:47:59,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:01,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:03,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:05,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:07,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:08,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:10,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:48:12,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:00,046 WARN L227 SmtUtils]: Spent 10.94s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:49:02,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:04,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:05,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:08,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:10,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:12,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:14,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:16,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:18,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:20,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:22,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:24,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:26,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:28,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:30,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:49:32,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:09,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:11,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:14,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:16,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:18,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:21,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:52,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:54,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:56,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:58,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:50:59,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:51:02,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:51:21,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 02:51:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:51:29,746 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2021-12-17 02:51:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-12-17 02:51:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 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 68 [2021-12-17 02:51:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:51:29,748 INFO L225 Difference]: With dead ends: 139 [2021-12-17 02:51:29,748 INFO L226 Difference]: Without dead ends: 137 [2021-12-17 02:51:29,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 322.9s TimeCoverageRelationStatistics Valid=1661, Invalid=7849, Unknown=100, NotChecked=5642, Total=15252 [2021-12-17 02:51:29,752 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 163 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 72 mSolverCounterUnsat, 105 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 230.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 105 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 231.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:51:29,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 727 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1404 Invalid, 105 Unknown, 39 Unchecked, 231.2s Time] [2021-12-17 02:51:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-17 02:51:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-12-17 02:51:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 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) [2021-12-17 02:51:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2021-12-17 02:51:29,775 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 68 [2021-12-17 02:51:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:51:29,776 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2021-12-17 02:51:29,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.869565217391304) internal successors, (198), 69 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:51:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2021-12-17 02:51:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-17 02:51:29,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:51:29,777 INFO L514 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2021-12-17 02:51:29,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 02:51:29,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:51:29,995 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:51:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:51:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash -309291742, now seen corresponding path program 5 times [2021-12-17 02:51:29,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:51:29,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498084505] [2021-12-17 02:51:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:51:29,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:51:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:51:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:51:31,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:51:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498084505] [2021-12-17 02:51:31,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498084505] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:51:31,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421428533] [2021-12-17 02:51:31,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:51:31,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:51:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:51:31,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:51:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Killed by 15