./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 2329fc70 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-?-2329fc7 [2023-02-13 23:12:17,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:12:17,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:12:17,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:12:17,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:12:17,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:12:17,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:12:17,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:12:17,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:12:17,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:12:17,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:12:17,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:12:17,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:12:17,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:12:17,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:12:17,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:12:17,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:12:17,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:12:17,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:12:17,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:12:17,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:12:17,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:12:17,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:12:17,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:12:17,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:12:17,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:12:17,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:12:17,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:12:17,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:12:17,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:12:17,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:12:17,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:12:17,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:12:17,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:12:17,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:12:17,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:12:17,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:12:17,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:12:17,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:12:17,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:12:17,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:12:17,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:12:17,585 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:12:17,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:12:17,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:12:17,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:12:17,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:12:17,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:12:17,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:12:17,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:12:17,595 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:12:17,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:12:17,595 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:12:17,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:12:17,597 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:12:17,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:12:17,597 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:12:17,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:12:17,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:12:17,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:12:17,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:12:17,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:17,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:12:17,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:12:17,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:12:17,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:12:17,600 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:12:17,600 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 [2023-02-13 23:12:17,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:12:17,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:12:17,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:12:17,776 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:12:17,776 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:12:17,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/jain_5-2.c [2023-02-13 23:12:18,667 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:12:18,812 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:12:18,813 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/jain_5-2.c [2023-02-13 23:12:18,817 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0391bff/001222e9c46547458ed58db25ce31656/FLAGe6357daa1 [2023-02-13 23:12:18,830 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0391bff/001222e9c46547458ed58db25ce31656 [2023-02-13 23:12:18,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:12:18,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:12:18,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:18,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:12:18,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:12:18,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:18" (1/1) ... [2023-02-13 23:12:18,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bd58db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:18, skipping insertion in model container [2023-02-13 23:12:18,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:18" (1/1) ... [2023-02-13 23:12:18,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:12:18,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:12:18,967 WARN L237 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] [2023-02-13 23:12:18,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:18,989 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:12:18,998 WARN L237 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] [2023-02-13 23:12:19,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:19,009 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:12:19,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19 WrapperNode [2023-02-13 23:12:19,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:19,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:19,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:12:19,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:12:19,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,030 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2023-02-13 23:12:19,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:19,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:12:19,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:12:19,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:12:19,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:12:19,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:12:19,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:12:19,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:12:19,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (1/1) ... [2023-02-13 23:12:19,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:19,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:19,072 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) [2023-02-13 23:12:19,077 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 [2023-02-13 23:12:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:12:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:12:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:12:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:12:19,140 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:12:19,142 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:12:19,209 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:12:19,213 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:12:19,213 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 23:12:19,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:19 BoogieIcfgContainer [2023-02-13 23:12:19,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:12:19,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:12:19,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:12:19,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:12:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:12:18" (1/3) ... [2023-02-13 23:12:19,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21961605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:19, skipping insertion in model container [2023-02-13 23:12:19,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:19" (2/3) ... [2023-02-13 23:12:19,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21961605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:19, skipping insertion in model container [2023-02-13 23:12:19,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:19" (3/3) ... [2023-02-13 23:12:19,220 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5-2.c [2023-02-13 23:12:19,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:12:19,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:12:19,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:12:19,266 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ffff211, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:12:19,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:12:19,270 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) [2023-02-13 23:12:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-13 23:12:19,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:19,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-13 23:12:19,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 28699754, now seen corresponding path program 1 times [2023-02-13 23:12:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:19,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652397988] [2023-02-13 23:12:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:19,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:19,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652397988] [2023-02-13 23:12:19,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652397988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:19,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:19,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:12:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252171153] [2023-02-13 23:12:19,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:12:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:12:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:12:19,538 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) [2023-02-13 23:12:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:19,600 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2023-02-13 23:12:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:12:19,602 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 [2023-02-13 23:12:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:19,607 INFO L225 Difference]: With dead ends: 18 [2023-02-13 23:12:19,607 INFO L226 Difference]: Without dead ends: 9 [2023-02-13 23:12:19,609 INFO L412 NwaCegarLoop]: 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 [2023-02-13 23:12:19,611 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:12:19,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:12:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-13 23:12:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-13 23:12:19,629 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) [2023-02-13 23:12:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-02-13 23:12:19,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-02-13 23:12:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-02-13 23:12:19,630 INFO L496 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) [2023-02-13 23:12:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-02-13 23:12:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-13 23:12:19,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:19,631 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:19,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:12:19,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 300686882, now seen corresponding path program 1 times [2023-02-13 23:12:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:19,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353260023] [2023-02-13 23:12:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353260023] [2023-02-13 23:12:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353260023] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:12:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830547157] [2023-02-13 23:12:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:19,778 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) [2023-02-13 23:12:19,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-13 23:12:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:19,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-13 23:12:19,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:20,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:20,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830547157] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:20,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:12:20,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-02-13 23:12:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199328639] [2023-02-13 23:12:20,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:20,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-13 23:12:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-13 23:12:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-13 23:12:20,200 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2023-02-13 23:12:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:20,291 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-02-13 23:12:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:12:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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 [2023-02-13 23:12:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:20,292 INFO L225 Difference]: With dead ends: 22 [2023-02-13 23:12:20,292 INFO L226 Difference]: Without dead ends: 20 [2023-02-13 23:12:20,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-02-13 23:12:20,298 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 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 [2023-02-13 23:12:20,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:12:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-13 23:12:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-13 23:12:20,306 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) [2023-02-13 23:12:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-02-13 23:12:20,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2023-02-13 23:12:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:20,311 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-02-13 23:12:20,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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) [2023-02-13 23:12:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-02-13 23:12:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-13 23:12:20,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:20,312 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2023-02-13 23:12:20,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-13 23:12:20,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:20,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1156434326, now seen corresponding path program 2 times [2023-02-13 23:12:20,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:20,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606614912] [2023-02-13 23:12:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:20,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606614912] [2023-02-13 23:12:20,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606614912] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:12:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066794636] [2023-02-13 23:12:20,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:12:20,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:20,702 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) [2023-02-13 23:12:20,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-13 23:12:20,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:12:20,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:20,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-13 23:12:20,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:20,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:21,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066794636] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:21,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:12:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2023-02-13 23:12:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492862926] [2023-02-13 23:12:21,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-13 23:12:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-13 23:12:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-02-13 23:12:21,182 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2023-02-13 23:12:27,289 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:12:29,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:12:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:30,092 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-02-13 23:12:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-13 23:12:30,095 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 [2023-02-13 23:12:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:30,095 INFO L225 Difference]: With dead ends: 40 [2023-02-13 23:12:30,095 INFO L226 Difference]: Without dead ends: 38 [2023-02-13 23:12:30,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2023-02-13 23:12:30,096 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-13 23:12:30,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 62 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-02-13 23:12:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-13 23:12:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-02-13 23:12:30,104 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) [2023-02-13 23:12:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2023-02-13 23:12:30,105 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2023-02-13 23:12:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:30,105 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2023-02-13 23:12:30,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2023-02-13 23:12:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2023-02-13 23:12:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-13 23:12:30,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:30,107 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2023-02-13 23:12:30,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-13 23:12:30,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-13 23:12:30,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1353352554, now seen corresponding path program 3 times [2023-02-13 23:12:30,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:30,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225318969] [2023-02-13 23:12:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:30,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225318969] [2023-02-13 23:12:30,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225318969] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:12:30,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832442385] [2023-02-13 23:12:30,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-13 23:12:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:30,711 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) [2023-02-13 23:12:30,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-13 23:12:32,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-13 23:12:32,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:32,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-13 23:12:32,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:32,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:12:33,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832442385] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:33,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:12:33,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2023-02-13 23:12:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671644210] [2023-02-13 23:12:33,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:33,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-13 23:12:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-13 23:12:33,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2023-02-13 23:12:33,069 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 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) [2023-02-13 23:12:35,337 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:12:37,349 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:12:39,364 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:12:41,373 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:12:43,381 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:13:28,254 WARN L233 SmtUtils]: Spent 26.48s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:13:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:32,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:34,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:37,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:39,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:41,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:13:44,126 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:13:46,136 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30))) is different from false [2023-02-13 23:14:03,339 WARN L233 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:14:05,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:07,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:09,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:11,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:13,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:15,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:18,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:20,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:22,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:24,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:26,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:34,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:36,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:38,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:40,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:42,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:44,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:46,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:48,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:50,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:52,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:14:54,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:03,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:05,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:07,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:09,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:13,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-13 23:15:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:15:13,910 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-02-13 23:15:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-13 23:15:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 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 [2023-02-13 23:15:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:15:13,911 INFO L225 Difference]: With dead ends: 73 [2023-02-13 23:15:13,912 INFO L226 Difference]: Without dead ends: 71 [2023-02-13 23:15:13,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 91.8s TimeCoverageRelationStatistics Valid=558, Invalid=2209, Unknown=17, NotChecked=756, Total=3540 [2023-02-13 23:15:13,913 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 67 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 19 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 69.4s IncrementalHoareTripleChecker+Time [2023-02-13 23:15:13,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 209 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 372 Invalid, 30 Unknown, 10 Unchecked, 69.4s Time] [2023-02-13 23:15:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-13 23:15:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2023-02-13 23:15:13,951 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) [2023-02-13 23:15:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2023-02-13 23:15:13,955 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 35 [2023-02-13 23:15:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:15:13,955 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2023-02-13 23:15:13,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 36 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) [2023-02-13 23:15:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2023-02-13 23:15:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-13 23:15:13,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:15:13,958 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2023-02-13 23:15:13,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-13 23:15:14,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:15:14,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:15:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:15:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1882756062, now seen corresponding path program 4 times [2023-02-13 23:15:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:15:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896923987] [2023-02-13 23:15:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:15:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:15:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:15:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:15:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:15:14,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896923987] [2023-02-13 23:15:14,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896923987] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:15:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061059647] [2023-02-13 23:15:14,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-13 23:15:14,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:15:14,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:15:14,964 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) [2023-02-13 23:15:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-13 23:15:15,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-13 23:15:15,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:15:15,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 101 conjunts are in the unsatisfiable core [2023-02-13 23:15:15,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:15:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:15:15,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:16:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:16:28,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061059647] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:16:28,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:16:28,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 71 [2023-02-13 23:16:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792904604] [2023-02-13 23:16:28,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:16:28,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-13 23:16:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:16:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-13 23:16:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=4143, Unknown=10, NotChecked=0, Total=4970 [2023-02-13 23:16:28,085 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 71 states, 71 states have (on average 2.788732394366197) internal successors, (198), 71 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) [2023-02-13 23:16:31,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) (.cse11 (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse16 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse19 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse15 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse18 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse20 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (not .cse8) .cse9) (not .cse10) (or (not .cse11) .cse6) (or .cse12 (not .cse13)) (or (not .cse14) .cse15) (or .cse11 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 924 (* |c_ULTIMATE.start_main_~y~0#1| 22)) 4294967296)))) (or .cse1 (not .cse16)) (or (not .cse7) .cse16) (or (not .cse17) .cse10) (or .cse18 (not .cse19)) (or (not .cse9) .cse13) (or (not .cse0) .cse8) (or (not .cse20) .cse19) (or .cse5 (not .cse3)) (or .cse14 (not .cse12)) (or .cse2 (not .cse15)) (or .cse17 (not .cse18)) (or .cse20 (not .cse4)))) is different from false [2023-02-13 23:16:33,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) (.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse15 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse18 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse14 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse19 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (or (not .cse8) .cse9) (not .cse10) (or (not (= 30 (mod (+ 840 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 21)) 4294967296))) .cse6) (or .cse11 (not .cse12)) (or (not .cse13) .cse14) (or .cse1 (not .cse15)) (or (not .cse7) .cse15) (or (not .cse16) .cse10) (or .cse17 (not .cse18)) (or (not .cse9) .cse12) (or (not .cse0) .cse8) (or (not .cse19) .cse18) (or .cse5 (not .cse3)) (or .cse13 (not .cse11)) (or .cse2 (not .cse14)) (or .cse16 (not .cse17)) (or .cse19 (not .cse4)))) is different from false [2023-02-13 23:16:35,038 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse15 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse18 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse14 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse17 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse19 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse8) (or (not .cse9) .cse10) (or .cse11 (not .cse12)) (or (not .cse13) .cse14) (or .cse1 (not .cse15)) (or (not .cse8) .cse15) (or (not .cse16) .cse4) (or .cse17 (not .cse18)) (or (not .cse10) .cse12) (not .cse5) (or (not .cse0) .cse9) (or (not .cse19) .cse18) (or .cse7 (not .cse3)) (or .cse13 (not .cse11)) (or .cse2 (not .cse14)) (or .cse16 (not .cse17)) (or .cse19 (not .cse6)))) is different from false [2023-02-13 23:16:37,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) (.cse14 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse17 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse18 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 20) 760) 4294967296))) .cse6) (or (not .cse7) .cse8) (not .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not .cse14)) (or (not .cse6) .cse14) (or (not .cse15) .cse9) (or .cse16 (not .cse17)) (or (not .cse8) .cse11) (or (not .cse0) .cse7) (or (not .cse18) .cse17) (or .cse5 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse15 (not .cse16)) (or .cse18 (not .cse4)))) is different from false [2023-02-13 23:16:39,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse14 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse17 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse16 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse18 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not .cse14)) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse14) (or (not .cse15) .cse4) (or .cse16 (not .cse17)) (or (not .cse9) .cse11) (not .cse5) (or (not .cse0) .cse8) (or (not .cse18) .cse17) (or .cse7 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse15 (not .cse16)) (or .cse18 (not .cse6)))) is different from false [2023-02-13 23:16:41,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse13 (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse16 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse17 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (not .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or .cse1 (not .cse13)) (or (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 684 (* |c_ULTIMATE.start_main_~y~0#1| 19)) 4294967296) 30)) .cse13) (or (not .cse14) .cse8) (or .cse15 (not .cse16)) (or (not .cse7) .cse10) (or (not .cse0) .cse6) (or (not .cse17) .cse16) (or .cse5 (not .cse3)) (or .cse11 (not .cse9)) (or .cse2 (not .cse12)) (or .cse14 (not .cse15)) (or .cse17 (not .cse4)))) is different from false [2023-02-13 23:16:43,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse5 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse16 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse13 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse15 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse17 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or (not .cse4) .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or .cse10 (not .cse11)) (or (not .cse12) .cse13) (or .cse1 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (or (not .cse14) .cse4) (or .cse15 (not .cse16)) (or (not .cse9) .cse11) (not .cse5) (or (not .cse0) .cse8) (or (not .cse17) .cse16) (or .cse7 (not .cse3)) (or .cse12 (not .cse10)) (or .cse2 (not .cse13)) (or .cse14 (not .cse15)) (or .cse17 (not .cse6)))) is different from false [2023-02-13 23:16:45,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse15 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse3 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse16 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (not .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or .cse1 (not (= (mod (+ 612 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18)) 4294967296) 30))) (or (not .cse13) .cse8) (or .cse14 (not .cse15)) (or (not .cse7) .cse10) (or (not .cse0) .cse6) (or (not .cse16) .cse15) (or .cse5 (not .cse3)) (or .cse11 (not .cse9)) (or .cse2 (not .cse12)) (or .cse13 (not .cse14)) (or .cse16 (not .cse4)))) is different from false [2023-02-13 23:16:47,101 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse10 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse4 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse7 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse15 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse6 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse12 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse14 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse16 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not .cse1) .cse2) (or (not .cse3) .cse4) (or .cse5 (not .cse6)) (or (not .cse7) .cse8) (or .cse9 (not .cse10)) (or (not .cse11) .cse12) (or (not .cse13) .cse3) (or .cse14 (not .cse15)) (or (not .cse8) .cse10) (not .cse4) (or (not .cse0) .cse7) (or (not .cse16) .cse15) (or .cse6 (not .cse2)) (or .cse11 (not .cse9)) (or .cse1 (not .cse12)) (or .cse13 (not .cse14)) (or .cse16 (not .cse5)))) is different from false [2023-02-13 23:16:49,109 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) (.cse5 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse14 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse2 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse1 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse11 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse15 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or .cse0 (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 544 (* |c_ULTIMATE.start_main_~y~0#1| 17)) 4294967296) 30))) (or (not .cse1) .cse2) (or .cse3 (not .cse4)) (or (not .cse5) .cse6) (not .cse7) (or .cse8 (not .cse9)) (or (not .cse10) .cse11) (or (not .cse12) .cse7) (or .cse13 (not .cse14)) (or (not .cse6) .cse9) (or (not .cse0) .cse5) (or (not .cse15) .cse14) (or .cse4 (not .cse2)) (or .cse10 (not .cse8)) (or .cse1 (not .cse11)) (or .cse12 (not .cse13)) (or .cse15 (not .cse3)))) is different from false [2023-02-13 23:16:51,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse9 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse6 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse14 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse11 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse13 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse15 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not .cse6) .cse7) (or .cse8 (not .cse9)) (or (not .cse10) .cse11) (or (not .cse12) .cse2) (or .cse13 (not .cse14)) (or (not .cse7) .cse9) (not .cse3) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse6) (or (not .cse15) .cse14) (or .cse5 (not .cse1)) (or .cse10 (not .cse8)) (or .cse0 (not .cse11)) (or .cse12 (not .cse13)) (or .cse15 (not .cse4)))) is different from false [2023-02-13 23:16:53,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse4 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse10 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse14 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (or (not .cse4) .cse5) (not .cse6) (or .cse7 (not .cse8)) (or (not .cse9) .cse10) (or (not .cse11) .cse6) (or .cse12 (not .cse13)) (or (not .cse5) .cse8) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 480 (* |c_ULTIMATE.start_main_~y~0#1| 16)) 4294967296))) .cse4) (or (not .cse14) .cse13) (or .cse3 (not .cse1)) (or .cse9 (not .cse7)) (or .cse0 (not .cse10)) (or .cse11 (not .cse12)) (or .cse14 (not .cse2)))) is different from false [2023-02-13 23:16:55,144 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse8 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse13 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse10 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse12 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse14 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) .cse6) (or .cse7 (not .cse8)) (or (not .cse9) .cse10) (or (not .cse11) .cse2) (or .cse12 (not .cse13)) (or (not .cse6) .cse8) (not .cse3) (or (not .cse14) .cse13) (or .cse5 (not .cse1)) (or .cse9 (not .cse7)) (or .cse0 (not .cse10)) (or .cse11 (not .cse12)) (or .cse14 (not .cse4)))) is different from false [2023-02-13 23:16:57,152 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse13 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 15) |c_ULTIMATE.start_main_~x~0#1| 420) 4294967296) 30)) .cse4) (not .cse5) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or (not .cse10) .cse5) (or .cse11 (not .cse12)) (or (not .cse4) .cse7) (or (not .cse13) .cse12) (or .cse3 (not .cse1)) (or .cse8 (not .cse6)) (or .cse0 (not .cse9)) (or .cse10 (not .cse11)) (or .cse13 (not .cse2)))) is different from false [2023-02-13 23:16:59,165 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse7 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse12 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse8 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse9 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse11 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse13 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or .cse6 (not .cse7)) (or (not .cse8) .cse9) (or (not .cse10) .cse2) (or .cse11 (not .cse12)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse7) (not .cse3) (or (not .cse13) .cse12) (or .cse5 (not .cse1)) (or .cse8 (not .cse6)) (or .cse0 (not .cse9)) (or .cse10 (not .cse11)) (or .cse13 (not .cse4)))) is different from false [2023-02-13 23:17:01,173 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296))) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse3 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse5 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse12 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or .cse2 (not .cse3)) (not .cse4) (or .cse5 (not .cse6)) (or (not .cse7) .cse8) (or (not .cse9) .cse4) (or .cse10 (not .cse11)) (or (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 364 (* |c_ULTIMATE.start_main_~y~0#1| 14)) 4294967296))) .cse6) (or (not .cse12) .cse11) (or .cse3 (not .cse1)) (or .cse7 (not .cse5)) (or .cse0 (not .cse8)) (or .cse9 (not .cse10)) (or .cse12 (not .cse2)))) is different from false [2023-02-13 23:17:03,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= 30 (mod (+ |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (.cse3 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse11 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 4) 24) 4294967296))) (.cse5 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 7) 84) 4294967296) 30)) (.cse1 (= 30 (mod (+ 112 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 8)) 4294967296))) (.cse7 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 11) 220) 4294967296) 30)) (.cse6 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 12) 264) 4294967296))) (.cse0 (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 144 (* |c_ULTIMATE.start_main_~y~0#1| 9)) 4294967296))) (.cse8 (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 10) |c_ULTIMATE.start_main_~x~0#1| 180) 4294967296) 30)) (.cse9 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 2) 4) 4294967296) 30)) (.cse10 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12 (* |c_ULTIMATE.start_main_~y~0#1| 3)) 4294967296) 30)) (.cse12 (= (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 5)) 4294967296) 30)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 6) 60) 4294967296) 30))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse3) (or .cse4 (not .cse5)) (or .cse6 (not (= 30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 13) 312) 4294967296)))) (or (not .cse7) .cse8) (or (not .cse9) .cse2) (or .cse10 (not .cse11)) (not .cse3) (or (not .cse12) .cse11) (or .cse5 (not .cse1)) (or .cse7 (not .cse6)) (or .cse0 (not .cse8)) (or .cse9 (not .cse10)) (or .cse12 (not .cse4)))) is different from false