/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 02:07:54,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 02:07:54,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 02:07:54,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 02:07:54,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 02:07:54,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 02:07:54,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 02:07:54,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 02:07:54,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 02:07:54,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 02:07:54,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 02:07:54,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 02:07:54,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 02:07:54,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 02:07:54,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 02:07:54,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 02:07:54,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 02:07:54,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 02:07:54,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 02:07:54,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 02:07:54,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 02:07:54,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 02:07:54,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 02:07:54,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 02:07:54,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 02:07:54,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 02:07:54,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 02:07:54,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 02:07:54,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 02:07:54,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 02:07:54,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 02:07:54,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 02:07:54,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 02:07:54,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 02:07:54,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 02:07:54,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 02:07:54,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 02:07:54,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 02:07:54,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 02:07:54,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 02:07:54,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 02:07:54,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 02:07:54,337 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 02:07:54,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 02:07:54,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 02:07:54,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 02:07:54,340 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 02:07:54,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 02:07:54,340 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 02:07:54,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 02:07:54,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 02:07:54,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 02:07:54,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 02:07:54,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 02:07:54,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 02:07:54,342 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 02:07:54,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 02:07:54,342 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 02:07:54,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 02:07:54,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 02:07:54,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 02:07:54,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 02:07:54,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 02:07:54,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 02:07:54,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 02:07:54,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 02:07:54,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 02:07:54,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 02:07:54,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:54,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 02:07:54,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 02:07:54,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 02:07:54,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 02:07:54,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 02:07:54,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 02:07:54,710 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 02:07:54,711 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 02:07:54,712 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 02:07:54,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381327822/5403b41d8066457fbd803b139496a7e7/FLAG62de1ab8b [2020-07-21 02:07:55,449 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 02:07:55,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 02:07:55,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381327822/5403b41d8066457fbd803b139496a7e7/FLAG62de1ab8b [2020-07-21 02:07:55,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381327822/5403b41d8066457fbd803b139496a7e7 [2020-07-21 02:07:55,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 02:07:55,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 02:07:55,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 02:07:55,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 02:07:55,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 02:07:55,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:07:55" (1/1) ... [2020-07-21 02:07:55,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d87159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:55, skipping insertion in model container [2020-07-21 02:07:55,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:07:55" (1/1) ... [2020-07-21 02:07:55,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 02:07:55,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 02:07:56,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:07:56,030 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 02:07:56,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 02:07:56,069 INFO L208 MainTranslator]: Completed translation [2020-07-21 02:07:56,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56 WrapperNode [2020-07-21 02:07:56,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 02:07:56,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 02:07:56,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 02:07:56,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 02:07:56,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... [2020-07-21 02:07:56,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 02:07:56,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 02:07:56,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 02:07:56,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 02:07:56,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 02:07:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 02:07:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 02:07:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 02:07:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 02:07:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 02:07:56,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 02:07:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 02:07:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 02:07:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 02:07:56,549 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 02:07:56,550 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 02:07:56,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:07:56 BoogieIcfgContainer [2020-07-21 02:07:56,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 02:07:56,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 02:07:56,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 02:07:56,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 02:07:56,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:07:55" (1/3) ... [2020-07-21 02:07:56,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ca478a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:07:56, skipping insertion in model container [2020-07-21 02:07:56,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:07:56" (2/3) ... [2020-07-21 02:07:56,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ca478a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:07:56, skipping insertion in model container [2020-07-21 02:07:56,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:07:56" (3/3) ... [2020-07-21 02:07:56,567 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-21 02:07:56,581 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 02:07:56,590 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 02:07:56,606 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 02:07:56,638 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 02:07:56,638 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 02:07:56,638 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 02:07:56,639 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 02:07:56,639 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 02:07:56,639 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 02:07:56,639 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 02:07:56,640 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 02:07:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 02:07:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 02:07:56,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:07:56,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:07:56,671 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:07:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:07:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2020-07-21 02:07:56,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:07:56,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41298359] [2020-07-21 02:07:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:56,753 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:07:56,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:07:56,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 02:07:56,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:07:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:56,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:07:56,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41298359] [2020-07-21 02:07:56,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:07:56,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 02:07:56,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851087622] [2020-07-21 02:07:56,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 02:07:56,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:07:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 02:07:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 02:07:56,818 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 02:07:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:07:56,848 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-21 02:07:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 02:07:56,850 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 02:07:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:07:56,861 INFO L225 Difference]: With dead ends: 32 [2020-07-21 02:07:56,861 INFO L226 Difference]: Without dead ends: 13 [2020-07-21 02:07:56,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 02:07:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-21 02:07:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-21 02:07:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-21 02:07:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-21 02:07:56,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-21 02:07:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:07:56,928 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-21 02:07:56,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 02:07:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-21 02:07:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 02:07:56,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:07:56,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:07:57,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:57,145 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:07:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:07:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2020-07-21 02:07:57,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:07:57,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1635629433] [2020-07-21 02:07:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:57,179 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 02:07:57,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:07:57,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 02:07:57,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:07:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:57,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 02:07:57,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1635629433] [2020-07-21 02:07:57,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 02:07:57,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 02:07:57,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569358109] [2020-07-21 02:07:57,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 02:07:57,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:07:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 02:07:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:07:57,267 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-21 02:07:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:07:57,388 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-21 02:07:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 02:07:57,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-21 02:07:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:07:57,391 INFO L225 Difference]: With dead ends: 24 [2020-07-21 02:07:57,391 INFO L226 Difference]: Without dead ends: 16 [2020-07-21 02:07:57,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 02:07:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-21 02:07:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-21 02:07:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 02:07:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 02:07:57,400 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 02:07:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:07:57,401 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 02:07:57,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 02:07:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 02:07:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 02:07:57,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:07:57,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:07:57,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:57,619 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:07:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:07:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2020-07-21 02:07:57,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:07:57,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101780072] [2020-07-21 02:07:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:57,665 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:07:57,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:07:57,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 02:07:57,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:07:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:57,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:07:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:57,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101780072] [2020-07-21 02:07:57,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:07:57,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-07-21 02:07:57,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157321760] [2020-07-21 02:07:57,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 02:07:57,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:07:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 02:07:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 02:07:57,837 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2020-07-21 02:07:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:07:58,010 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-21 02:07:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 02:07:58,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-21 02:07:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:07:58,014 INFO L225 Difference]: With dead ends: 31 [2020-07-21 02:07:58,015 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 02:07:58,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-21 02:07:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 02:07:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 02:07:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 02:07:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-21 02:07:58,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2020-07-21 02:07:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:07:58,027 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-21 02:07:58,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 02:07:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-21 02:07:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 02:07:58,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:07:58,029 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:07:58,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:58,243 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:07:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:07:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1289106634, now seen corresponding path program 1 times [2020-07-21 02:07:58,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:07:58,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412503077] [2020-07-21 02:07:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:58,283 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:07:58,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:07:58,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 02:07:58,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:07:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 02:07:58,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:07:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 02:07:58,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412503077] [2020-07-21 02:07:58,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:07:58,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-21 02:07:58,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934850771] [2020-07-21 02:07:58,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 02:07:58,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:07:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 02:07:58,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 02:07:58,519 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-21 02:07:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:07:58,761 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-21 02:07:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 02:07:58,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-21 02:07:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:07:58,766 INFO L225 Difference]: With dead ends: 43 [2020-07-21 02:07:58,766 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 02:07:58,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-21 02:07:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 02:07:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-21 02:07:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-21 02:07:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-21 02:07:58,779 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-21 02:07:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:07:58,780 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-21 02:07:58,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 02:07:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-21 02:07:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 02:07:58,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:07:58,781 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:07:58,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:58,997 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:07:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:07:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 2 times [2020-07-21 02:07:58,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:07:59,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274374818] [2020-07-21 02:07:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:07:59,040 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:07:59,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:07:59,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 02:07:59,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:07:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:59,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:07:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:07:59,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274374818] [2020-07-21 02:07:59,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:07:59,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-07-21 02:07:59,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476950309] [2020-07-21 02:07:59,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 02:07:59,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:07:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 02:07:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-21 02:07:59,324 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2020-07-21 02:07:59,656 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 02:08:04,107 WARN L193 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 02:08:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:08:04,514 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-21 02:08:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 02:08:04,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-21 02:08:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:08:04,517 INFO L225 Difference]: With dead ends: 46 [2020-07-21 02:08:04,517 INFO L226 Difference]: Without dead ends: 41 [2020-07-21 02:08:04,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2020-07-21 02:08:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-21 02:08:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-21 02:08:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 02:08:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-21 02:08:04,528 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2020-07-21 02:08:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:08:04,529 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-21 02:08:04,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 02:08:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-21 02:08:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 02:08:04,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:08:04,531 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:08:04,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:08:04,747 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:08:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:08:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1362713706, now seen corresponding path program 2 times [2020-07-21 02:08:04,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:08:04,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [423238048] [2020-07-21 02:08:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:08:04,791 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 02:08:04,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:08:04,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 02:08:04,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:08:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 02:08:04,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:08:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 02:08:07,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [423238048] [2020-07-21 02:08:07,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:08:07,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-21 02:08:07,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722498272] [2020-07-21 02:08:07,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 02:08:07,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:08:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 02:08:07,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=161, Unknown=1, NotChecked=0, Total=240 [2020-07-21 02:08:07,177 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2020-07-21 02:08:09,427 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000)) is different from false [2020-07-21 02:08:12,060 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2020-07-21 02:08:12,349 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2020-07-21 02:08:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:08:16,854 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-21 02:08:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-21 02:08:16,856 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-21 02:08:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:08:16,857 INFO L225 Difference]: With dead ends: 75 [2020-07-21 02:08:16,858 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 02:08:16,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=169, Invalid=294, Unknown=3, NotChecked=40, Total=506 [2020-07-21 02:08:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 02:08:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-21 02:08:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 02:08:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 02:08:16,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 40 [2020-07-21 02:08:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:08:16,873 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 02:08:16,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 02:08:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 02:08:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 02:08:16,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:08:16,875 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:08:17,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:08:17,081 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:08:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:08:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1588607722, now seen corresponding path program 3 times [2020-07-21 02:08:17,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:08:17,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792844674] [2020-07-21 02:08:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:08:17,120 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:08:17,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:08:17,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 02:08:17,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:08:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:08:17,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:08:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:08:19,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792844674] [2020-07-21 02:08:19,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:08:19,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-07-21 02:08:19,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131728948] [2020-07-21 02:08:19,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 02:08:19,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:08:19,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 02:08:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=419, Unknown=1, NotChecked=0, Total=600 [2020-07-21 02:08:19,986 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 25 states. [2020-07-21 02:09:16,697 WARN L193 SmtUtils]: Spent 52.44 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-07-21 02:09:20,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 02:09:41,669 WARN L193 SmtUtils]: Spent 18.83 s on a formula simplification that was a NOOP. DAG size: 50 [2020-07-21 02:09:43,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 02:09:56,343 WARN L193 SmtUtils]: Spent 9.42 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-21 02:10:09,417 WARN L193 SmtUtils]: Spent 11.31 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-21 02:10:26,747 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 02:10:38,208 WARN L193 SmtUtils]: Spent 10.48 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 02:10:39,023 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 02:10:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:10:40,147 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2020-07-21 02:10:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-21 02:10:40,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2020-07-21 02:10:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:10:40,152 INFO L225 Difference]: With dead ends: 83 [2020-07-21 02:10:40,152 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 02:10:40,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 128.4s TimeCoverageRelationStatistics Valid=410, Invalid=780, Unknown=8, NotChecked=134, Total=1332 [2020-07-21 02:10:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 02:10:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2020-07-21 02:10:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-21 02:10:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-21 02:10:40,167 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 40 [2020-07-21 02:10:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:10:40,168 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-21 02:10:40,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 02:10:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-21 02:10:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-21 02:10:40,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:10:40,170 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:10:40,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:10:40,377 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:10:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:10:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1251792523, now seen corresponding path program 3 times [2020-07-21 02:10:40,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:10:40,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698210383] [2020-07-21 02:10:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:10:40,420 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:10:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:10:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-21 02:10:40,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:10:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:10:40,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:10:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:10:41,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698210383] [2020-07-21 02:10:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:10:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-07-21 02:10:41,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000669392] [2020-07-21 02:10:41,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-21 02:10:41,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:10:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-21 02:10:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2020-07-21 02:10:41,439 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 32 states. [2020-07-21 02:10:50,197 WARN L193 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 76 DAG size of output: 11 [2020-07-21 02:10:52,222 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000)) is different from false [2020-07-21 02:10:54,240 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000)) is different from false [2020-07-21 02:11:02,637 WARN L193 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 66 DAG size of output: 11 [2020-07-21 02:11:09,588 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 11 [2020-07-21 02:11:18,402 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2020-07-21 02:11:25,318 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-07-21 02:11:35,780 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2020-07-21 02:11:43,441 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2020-07-21 02:11:51,881 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-21 02:11:53,932 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000)) is different from false [2020-07-21 02:12:11,628 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 16 [2020-07-21 02:12:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:12:11,922 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2020-07-21 02:12:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-07-21 02:12:11,923 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2020-07-21 02:12:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:12:11,925 INFO L225 Difference]: With dead ends: 118 [2020-07-21 02:12:11,925 INFO L226 Difference]: Without dead ends: 110 [2020-07-21 02:12:11,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 90.4s TimeCoverageRelationStatistics Valid=689, Invalid=1289, Unknown=14, NotChecked=264, Total=2256 [2020-07-21 02:12:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-21 02:12:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2020-07-21 02:12:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-21 02:12:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-21 02:12:11,957 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 55 [2020-07-21 02:12:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:12:11,958 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-21 02:12:11,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-21 02:12:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-21 02:12:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-21 02:12:11,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:12:11,965 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:12:12,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:12,166 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:12:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:12:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1507791018, now seen corresponding path program 4 times [2020-07-21 02:12:12,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:12:12,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113853985] [2020-07-21 02:12:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:12:12,219 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:12:12,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:12:12,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 50 conjunts are in the unsatisfiable core [2020-07-21 02:12:12,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:12:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:12:12,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:12:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 712 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:12:19,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113853985] [2020-07-21 02:12:19,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:12:19,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2020-07-21 02:12:19,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046886530] [2020-07-21 02:12:19,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-07-21 02:12:19,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:12:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-07-21 02:12:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=1702, Unknown=2, NotChecked=0, Total=2352 [2020-07-21 02:12:19,675 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 49 states. [2020-07-21 02:12:23,097 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~x~0 3)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse1 (+ c_main_~x~0 1)) (.cse4 (+ c_main_~x~0 2)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod .cse3 4294967296) .cse0) (or (<= .cse2 (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod .cse4 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:25,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~x~0 3)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse1 (+ c_main_~x~0 1)) (.cse4 (+ c_main_~x~0 2)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod .cse3 4294967296) .cse0) (or (<= .cse2 (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod .cse4 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:27,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~y~0 4294967296)) (.cse1 (+ c_main_~x~0 1)) (.cse3 (+ c_main_~x~0 2)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (or (<= .cse2 (mod c_main_~x~0 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (or (<= .cse2 (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod .cse3 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:29,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~y~0 4294967296)) (.cse1 (+ c_main_~x~0 1)) (.cse3 (+ c_main_~x~0 2)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (or (<= .cse2 (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod .cse3 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:31,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~y~0 4294967296)) (.cse1 (+ c_main_~x~0 1)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (or (<= .cse2 (mod c_main_~x~0 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (or (<= .cse2 (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:33,238 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~x~0 1)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (or (<= (mod c_main_~y~0 4294967296) (mod .cse1 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:35,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (or (<= (mod c_main_~y~0 4294967296) (mod c_main_~x~0 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:37,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:39,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:41,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:43,348 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:45,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:12:47,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:14:17,251 WARN L193 SmtUtils]: Spent 59.52 s on a formula simplification that was a NOOP. DAG size: 85 [2020-07-21 02:14:29,285 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:14:31,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:14:33,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:15:02,477 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0))) is different from false [2020-07-21 02:15:04,542 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0))) is different from false [2020-07-21 02:15:06,587 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0))) is different from false [2020-07-21 02:15:08,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0))) is different from false [2020-07-21 02:15:10,625 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:15:12,647 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:15:59,186 WARN L193 SmtUtils]: Spent 28.42 s on a formula simplification that was a NOOP. DAG size: 60 [2020-07-21 02:16:18,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:16:57,397 WARN L193 SmtUtils]: Spent 23.25 s on a formula simplification that was a NOOP. DAG size: 55 [2020-07-21 02:17:05,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:17:07,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:17:09,983 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:17:32,137 WARN L193 SmtUtils]: Spent 10.12 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-21 02:17:58,210 WARN L193 SmtUtils]: Spent 9.10 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-21 02:18:40,377 WARN L193 SmtUtils]: Spent 7.01 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 02:18:43,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:18:45,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-21 02:18:51,695 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 02:18:56,386 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 02:18:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 02:18:59,230 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2020-07-21 02:18:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-07-21 02:18:59,232 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 76 [2020-07-21 02:18:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 02:18:59,235 INFO L225 Difference]: With dead ends: 155 [2020-07-21 02:18:59,235 INFO L226 Difference]: Without dead ends: 150 [2020-07-21 02:18:59,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 315.0s TimeCoverageRelationStatistics Valid=1049, Invalid=2425, Unknown=60, NotChecked=3948, Total=7482 [2020-07-21 02:18:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-21 02:18:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2020-07-21 02:18:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-21 02:18:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2020-07-21 02:18:59,256 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 76 [2020-07-21 02:18:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 02:18:59,257 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2020-07-21 02:18:59,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-07-21 02:18:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2020-07-21 02:18:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-21 02:18:59,259 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 02:18:59,259 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 02:18:59,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:18:59,462 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 02:18:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 02:18:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -242211211, now seen corresponding path program 4 times [2020-07-21 02:18:59,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 02:18:59,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028044601] [2020-07-21 02:18:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 02:18:59,514 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 02:18:59,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 02:18:59,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2020-07-21 02:18:59,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 02:19:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 61 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:19:00,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 02:19:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 61 proven. 1357 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 02:19:24,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028044601] [2020-07-21 02:19:24,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 02:19:24,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2020-07-21 02:19:24,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530647812] [2020-07-21 02:19:24,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-07-21 02:19:24,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 02:19:24,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-07-21 02:19:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2937, Unknown=9, NotChecked=0, Total=4032 [2020-07-21 02:19:24,705 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 64 states. [2020-07-21 02:19:28,778 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:30,789 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:32,808 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:34,819 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:36,831 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:38,841 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:40,851 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:42,864 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:44,897 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:46,910 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:48,921 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:50,955 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:52,963 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000)) is different from false [2020-07-21 02:19:54,982 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000)) is different from false [2020-07-21 02:19:56,991 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000)) is different from false [2020-07-21 02:19:59,000 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000)) is different from false [2020-07-21 02:20:30,490 WARN L193 SmtUtils]: Spent 12.79 s on a formula simplification. DAG size of input: 116 DAG size of output: 11 [2020-07-21 02:21:04,406 WARN L193 SmtUtils]: Spent 10.09 s on a formula simplification. DAG size of input: 111 DAG size of output: 11 [2020-07-21 02:21:06,425 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000)) is different from false [2020-07-21 02:21:37,923 WARN L193 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 103 DAG size of output: 13 [2020-07-21 02:22:04,984 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 101 DAG size of output: 11 [2020-07-21 02:22:41,900 WARN L193 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 96 DAG size of output: 11