/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 23:37:27,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 23:37:27,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 23:37:27,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 23:37:27,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 23:37:27,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 23:37:27,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 23:37:27,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 23:37:27,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 23:37:27,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 23:37:27,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 23:37:27,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 23:37:27,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 23:37:27,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 23:37:27,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 23:37:27,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 23:37:27,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 23:37:27,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 23:37:27,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 23:37:27,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 23:37:27,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 23:37:27,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 23:37:27,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 23:37:27,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 23:37:28,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 23:37:28,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 23:37:28,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 23:37:28,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 23:37:28,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 23:37:28,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 23:37:28,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 23:37:28,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 23:37:28,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 23:37:28,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 23:37:28,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 23:37:28,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 23:37:28,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 23:37:28,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 23:37:28,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 23:37:28,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 23:37:28,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 23:37:28,022 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 23:37:28,071 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 23:37:28,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 23:37:28,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 23:37:28,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 23:37:28,077 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 23:37:28,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 23:37:28,078 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 23:37:28,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 23:37:28,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 23:37:28,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 23:37:28,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 23:37:28,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 23:37:28,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 23:37:28,083 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 23:37:28,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 23:37:28,083 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 23:37:28,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 23:37:28,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 23:37:28,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 23:37:28,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 23:37:28,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 23:37:28,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:37:28,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 23:37:28,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 23:37:28,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 23:37:28,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 23:37:28,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:28,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 23:37:28,088 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 23:37:28,088 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 23:37:28,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 23:37:28,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 23:37:28,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 23:37:28,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 23:37:28,662 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 23:37:28,663 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 23:37:28,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af66f4f45/9d67407724ba4847a7fb043885ca3994/FLAG1b7b5af6b [2020-07-21 23:37:29,601 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 23:37:29,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 23:37:29,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af66f4f45/9d67407724ba4847a7fb043885ca3994/FLAG1b7b5af6b [2020-07-21 23:37:29,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af66f4f45/9d67407724ba4847a7fb043885ca3994 [2020-07-21 23:37:29,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 23:37:29,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 23:37:29,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 23:37:29,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 23:37:29,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 23:37:29,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:29" (1/1) ... [2020-07-21 23:37:29,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1386e939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:29, skipping insertion in model container [2020-07-21 23:37:29,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:29" (1/1) ... [2020-07-21 23:37:29,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 23:37:29,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 23:37:30,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:37:30,209 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 23:37:30,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:37:30,248 INFO L208 MainTranslator]: Completed translation [2020-07-21 23:37:30,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30 WrapperNode [2020-07-21 23:37:30,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 23:37:30,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 23:37:30,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 23:37:30,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 23:37:30,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (1/1) ... [2020-07-21 23:37:30,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 23:37:30,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 23:37:30,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 23:37:30,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 23:37:30,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (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 23:37:30,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 23:37:30,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 23:37:30,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 23:37:30,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 23:37:30,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 23:37:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 23:37:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 23:37:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 23:37:30,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 23:37:30,836 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 23:37:30,836 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 23:37:30,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:30 BoogieIcfgContainer [2020-07-21 23:37:30,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 23:37:30,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 23:37:30,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 23:37:30,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 23:37:30,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:37:29" (1/3) ... [2020-07-21 23:37:30,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad2dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:30, skipping insertion in model container [2020-07-21 23:37:30,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:30" (2/3) ... [2020-07-21 23:37:30,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad2dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:30, skipping insertion in model container [2020-07-21 23:37:30,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:30" (3/3) ... [2020-07-21 23:37:30,860 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-21 23:37:30,882 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 23:37:30,899 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 23:37:30,925 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 23:37:30,987 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 23:37:30,988 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 23:37:30,988 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 23:37:30,988 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 23:37:30,989 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 23:37:30,989 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 23:37:30,990 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 23:37:30,991 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 23:37:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 23:37:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 23:37:31,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:31,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:31,060 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2020-07-21 23:37:31,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:31,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878347766] [2020-07-21 23:37:31,103 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 23:37:31,212 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:37:31,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:31,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 23:37:31,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:31,254 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 23:37:31,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:37:31,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878347766] [2020-07-21 23:37:31,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:37:31,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 23:37:31,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046738042] [2020-07-21 23:37:31,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 23:37:31,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 23:37:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 23:37:31,296 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 23:37:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:31,344 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-21 23:37:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 23:37:31,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 23:37:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:31,365 INFO L225 Difference]: With dead ends: 32 [2020-07-21 23:37:31,365 INFO L226 Difference]: Without dead ends: 13 [2020-07-21 23:37:31,374 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 23:37:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-21 23:37:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-21 23:37:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-21 23:37:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-21 23:37:31,443 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-21 23:37:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:31,444 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-21 23:37:31,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 23:37:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-21 23:37:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 23:37:31,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:31,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:31,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:31,649 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:31,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:31,650 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2020-07-21 23:37:31,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:31,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854892094] [2020-07-21 23:37:31,652 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 23:37:31,695 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:37:31,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:31,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 23:37:31,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:31,762 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 23:37:31,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:37:31,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854892094] [2020-07-21 23:37:31,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:37:31,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:37:31,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079337858] [2020-07-21 23:37:31,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:37:31,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:37:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:37:31,770 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-21 23:37:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:31,893 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-21 23:37:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:37:31,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-21 23:37:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:31,900 INFO L225 Difference]: With dead ends: 24 [2020-07-21 23:37:31,901 INFO L226 Difference]: Without dead ends: 16 [2020-07-21 23:37:31,906 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 23:37:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-21 23:37:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-21 23:37:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 23:37:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 23:37:31,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 23:37:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:31,930 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 23:37:31,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:37:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 23:37:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 23:37:31,937 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:31,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:32,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:32,155 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2020-07-21 23:37:32,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:32,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903832067] [2020-07-21 23:37:32,158 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 23:37:32,210 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:37:32,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:32,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:37:32,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:32,287 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 23:37:32,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:37:32,430 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 23:37:32,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903832067] [2020-07-21 23:37:32,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:37:32,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-07-21 23:37:32,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928166069] [2020-07-21 23:37:32,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 23:37:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 23:37:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 23:37:32,437 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2020-07-21 23:37:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:32,713 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-21 23:37:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 23:37:32,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-21 23:37:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:32,716 INFO L225 Difference]: With dead ends: 31 [2020-07-21 23:37:32,716 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 23:37:32,718 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 23:37:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 23:37:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 23:37:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 23:37:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-21 23:37:32,729 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2020-07-21 23:37:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:32,730 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-21 23:37:32,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 23:37:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-21 23:37:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 23:37:32,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:32,732 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:32,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:32,948 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1289106634, now seen corresponding path program 1 times [2020-07-21 23:37:32,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:32,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353387577] [2020-07-21 23:37:32,950 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 23:37:33,013 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:37:33,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:33,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 23:37:33,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:33,111 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 23:37:33,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:37:33,272 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 23:37:33,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353387577] [2020-07-21 23:37:33,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:37:33,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-21 23:37:33,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997783248] [2020-07-21 23:37:33,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 23:37:33,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 23:37:33,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 23:37:33,286 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-21 23:37:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:33,638 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-21 23:37:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 23:37:33,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-21 23:37:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:33,646 INFO L225 Difference]: With dead ends: 43 [2020-07-21 23:37:33,647 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 23:37:33,649 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 23:37:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 23:37:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-21 23:37:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-21 23:37:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-21 23:37:33,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-21 23:37:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:33,667 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-21 23:37:33,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 23:37:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-21 23:37:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 23:37:33,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:33,669 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:33,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:33,882 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 2 times [2020-07-21 23:37:33,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:33,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362964501] [2020-07-21 23:37:33,888 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 23:37:33,941 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:37:33,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:33,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 23:37:33,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:34,130 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 23:37:34,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:37:34,552 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 23:37:34,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362964501] [2020-07-21 23:37:34,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:37:34,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-07-21 23:37:34,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387690652] [2020-07-21 23:37:34,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 23:37:34,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 23:37:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-21 23:37:34,557 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2020-07-21 23:37:39,303 WARN L193 SmtUtils]: Spent 4.47 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 23:37:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:40,485 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-21 23:37:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 23:37:40,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-21 23:37:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:40,496 INFO L225 Difference]: With dead ends: 46 [2020-07-21 23:37:40,502 INFO L226 Difference]: Without dead ends: 41 [2020-07-21 23:37:40,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2020-07-21 23:37:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-21 23:37:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-21 23:37:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 23:37:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-21 23:37:40,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2020-07-21 23:37:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:40,555 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-21 23:37:40,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 23:37:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-21 23:37:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 23:37:40,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:40,560 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:40,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:40,764 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1362713706, now seen corresponding path program 2 times [2020-07-21 23:37:40,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:40,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835052749] [2020-07-21 23:37:40,768 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 23:37:40,818 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:37:40,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:40,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 23:37:40,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:40,940 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 23:37:40,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:37:41,282 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 23:37:41,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835052749] [2020-07-21 23:37:41,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:37:41,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-21 23:37:41,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825356843] [2020-07-21 23:37:41,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 23:37:41,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 23:37:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-21 23:37:41,306 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2020-07-21 23:37:43,777 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-21 23:37:45,133 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-07-21 23:37:49,492 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2020-07-21 23:37:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:37:56,965 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-21 23:37:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 23:37:56,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-21 23:37:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:37:56,972 INFO L225 Difference]: With dead ends: 75 [2020-07-21 23:37:56,973 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 23:37:56,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=171, Invalid=287, Unknown=4, NotChecked=0, Total=462 [2020-07-21 23:37:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 23:37:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-21 23:37:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 23:37:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 23:37:56,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 40 [2020-07-21 23:37:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:37:56,994 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 23:37:56,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 23:37:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 23:37:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 23:37:56,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:37:56,997 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:37:57,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:37:57,213 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:37:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:37:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1588607722, now seen corresponding path program 3 times [2020-07-21 23:37:57,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:37:57,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122364882] [2020-07-21 23:37:57,216 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 23:37:57,272 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:37:57,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:37:57,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 23:37:57,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:37:57,542 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 23:37:57,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:37:58,354 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 23:37:58,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122364882] [2020-07-21 23:37:58,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:37:58,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-07-21 23:37:58,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200347590] [2020-07-21 23:37:58,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 23:37:58,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:37:58,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 23:37:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2020-07-21 23:37:58,359 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 25 states. [2020-07-21 23:38:58,273 WARN L193 SmtUtils]: Spent 59.19 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-07-21 23:39:02,526 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 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0))) is different from false [2020-07-21 23:39:04,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0))) is different from false [2020-07-21 23:39:30,388 WARN L193 SmtUtils]: Spent 17.30 s on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 23:39:35,164 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 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0))) is different from false [2020-07-21 23:39:44,525 WARN L193 SmtUtils]: Spent 6.56 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-21 23:39:55,975 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-21 23:39:58,013 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 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 23:40:03,341 WARN L193 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 41 [2020-07-21 23:40:05,560 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 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0))) is different from false [2020-07-21 23:40:07,596 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 23:40:09,935 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 23:40:11,969 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 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 23:40:19,999 WARN L193 SmtUtils]: Spent 4.18 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 23:40:23,486 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-21 23:40:25,786 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 18 [2020-07-21 23:40:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:40:36,414 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2020-07-21 23:40:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-07-21 23:40:36,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2020-07-21 23:40:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:40:36,417 INFO L225 Difference]: With dead ends: 96 [2020-07-21 23:40:36,417 INFO L226 Difference]: Without dead ends: 91 [2020-07-21 23:40:36,419 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 138.7s TimeCoverageRelationStatistics Valid=512, Invalid=1065, Unknown=11, NotChecked=574, Total=2162 [2020-07-21 23:40:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-21 23:40:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2020-07-21 23:40:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-21 23:40:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2020-07-21 23:40:36,435 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 40 [2020-07-21 23:40:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:40:36,436 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2020-07-21 23:40:36,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 23:40:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2020-07-21 23:40:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-21 23:40:36,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:40:36,438 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:40:36,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:40:36,641 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:40:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:40:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1251792523, now seen corresponding path program 3 times [2020-07-21 23:40:36,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:40:36,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096541443] [2020-07-21 23:40:36,644 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 23:40:36,679 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:40:36,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:40:36,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-21 23:40:36,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:40:36,887 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 23:40:36,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:40:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 298 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:40:41,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096541443] [2020-07-21 23:40:41,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:40:41,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-07-21 23:40:41,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766601067] [2020-07-21 23:40:41,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-21 23:40:41,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:40:41,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-21 23:40:41,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=704, Unknown=2, NotChecked=0, Total=992 [2020-07-21 23:40:41,788 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 32 states. [2020-07-21 23:40:46,245 WARN L193 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 11 [2020-07-21 23:40:55,327 WARN L193 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2020-07-21 23:41:02,471 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 11 [2020-07-21 23:41:12,066 WARN L193 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 61 DAG size of output: 11 [2020-07-21 23:41:29,356 WARN L193 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2020-07-21 23:41:41,818 WARN L193 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-07-21 23:41:48,071 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2020-07-21 23:41:50,133 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 23:42:02,493 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 13 [2020-07-21 23:42:15,374 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2020-07-21 23:42:25,244 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-07-21 23:42:38,497 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000)) is different from false [2020-07-21 23:42:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:42:45,702 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2020-07-21 23:42:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-21 23:42:45,703 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2020-07-21 23:42:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:42:45,705 INFO L225 Difference]: With dead ends: 136 [2020-07-21 23:42:45,705 INFO L226 Difference]: Without dead ends: 109 [2020-07-21 23:42:45,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 115.3s TimeCoverageRelationStatistics Valid=717, Invalid=1337, Unknown=24, NotChecked=178, Total=2256 [2020-07-21 23:42:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-21 23:42:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2020-07-21 23:42:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-21 23:42:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-21 23:42:45,721 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 55 [2020-07-21 23:42:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:42:45,724 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-21 23:42:45,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-21 23:42:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-21 23:42:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-21 23:42:45,726 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:42:45,726 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:42:45,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:42:45,940 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:42:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:42:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1507791018, now seen corresponding path program 4 times [2020-07-21 23:42:45,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:42:45,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [119174101] [2020-07-21 23:42:45,942 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 23:42:46,018 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:42:46,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:42:46,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 50 conjunts are in the unsatisfiable core [2020-07-21 23:42:46,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:42:46,571 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 23:42:46,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:42:51,068 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 23:42:51,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [119174101] [2020-07-21 23:42:51,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:42:51,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2020-07-21 23:42:51,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756454705] [2020-07-21 23:42:51,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-07-21 23:42:51,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:42:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-07-21 23:42:51,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=1703, Unknown=1, NotChecked=0, Total=2352 [2020-07-21 23:42:51,072 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 49 states. [2020-07-21 23:42:54,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~x~0 3)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse4 (+ c_main_~x~0 2)) (.cse3 (+ 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (or (< (mod (+ c_main_~x~0 22) 4294967296) .cse0) (<= .cse2 (mod .cse1 4294967296))) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod .cse4 4294967296) .cse0) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod .cse3 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0))) is different from false [2020-07-21 23:42:56,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~x~0 3)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse4 (+ c_main_~x~0 2)) (.cse3 (+ 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (or (< (mod (+ c_main_~x~0 22) 4294967296) .cse0) (<= .cse2 (mod .cse1 4294967296))) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod .cse4 4294967296) .cse0) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod .cse3 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0))) is different from false [2020-07-21 23:42:58,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296)) (.cse3 (+ c_main_~x~0 2)) (.cse2 (+ c_main_~x~0 1)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (or (<= .cse1 (mod c_main_~x~0 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (or (<= .cse1 (mod .cse2 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod .cse3 4294967296) .cse0) (or (<= .cse1 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod .cse2 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:00,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296)) (.cse3 (+ c_main_~x~0 2)) (.cse2 (+ c_main_~x~0 1)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (or (<= .cse1 (mod .cse2 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod .cse3 4294967296) .cse0) (or (<= .cse1 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0)) (< (mod .cse2 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0))) is different from false [2020-07-21 23:43:02,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (+ c_main_~x~0 1)) (.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (or (<= .cse1 (mod c_main_~x~0 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (or (<= .cse1 (mod .cse2 4294967296)) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0)) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod .cse2 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:04,366 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 (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 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 2) 4294967296) .cse0) (< (mod .cse1 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0))) is different from false [2020-07-21 23:43:06,375 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 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 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:08,393 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0))) is different from false [2020-07-21 23:43:10,418 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:12,440 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:14,456 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:16,509 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:18,546 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:20,579 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:43:22,589 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:44:38,953 WARN L193 SmtUtils]: Spent 54.97 s on a formula simplification that was a NOOP. DAG size: 80 [2020-07-21 23:45:24,800 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:45:26,821 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:45:28,872 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:46:16,573 WARN L193 SmtUtils]: Spent 16.87 s on a formula simplification that was a NOOP. DAG size: 70 [2020-07-21 23:46:26,761 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:46:28,771 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0))) is different from false [2020-07-21 23:46:30,788 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 23:46:32,838 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 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0))) is different from false [2020-07-21 23:47:14,948 WARN L193 SmtUtils]: Spent 23.81 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-21 23:47:52,008 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 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 23:47:54,028 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 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0))) is different from false [2020-07-21 23:47:56,071 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 23:47:58,199 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0))) is different from false [2020-07-21 23:48:25,052 WARN L193 SmtUtils]: Spent 11.15 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-21 23:48:31,714 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 23:48:33,768 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 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0))) is different from false [2020-07-21 23:48:47,948 WARN L193 SmtUtils]: Spent 3.54 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 23:48:52,666 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 23:49:03,868 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 18 [2020-07-21 23:49:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:49:05,282 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2020-07-21 23:49:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2020-07-21 23:49:05,283 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 76 [2020-07-21 23:49:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:49:05,288 INFO L225 Difference]: With dead ends: 156 [2020-07-21 23:49:05,288 INFO L226 Difference]: Without dead ends: 151 [2020-07-21 23:49:05,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 281.5s TimeCoverageRelationStatistics Valid=1018, Invalid=2336, Unknown=64, NotChecked=3892, Total=7310 [2020-07-21 23:49:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-21 23:49:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2020-07-21 23:49:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-21 23:49:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2020-07-21 23:49:05,316 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 76 [2020-07-21 23:49:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:49:05,317 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2020-07-21 23:49:05,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-07-21 23:49:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2020-07-21 23:49:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-07-21 23:49:05,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:49:05,319 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:49:05,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:49:05,533 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:49:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:49:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1498605686, now seen corresponding path program 4 times [2020-07-21 23:49:05,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:49:05,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1745290492] [2020-07-21 23:49:05,535 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 23:49:05,585 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:49:05,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:49:05,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 63 conjunts are in the unsatisfiable core [2020-07-21 23:49:05,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:49:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 153 proven. 1365 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 23:49:06,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:49:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 153 proven. 1353 refuted. 12 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 23:49:28,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1745290492] [2020-07-21 23:49:28,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:49:28,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2020-07-21 23:49:28,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548464865] [2020-07-21 23:49:28,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-07-21 23:49:28,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:49:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-07-21 23:49:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2937, Unknown=9, NotChecked=0, Total=4032 [2020-07-21 23:49:28,841 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 64 states. [2020-07-21 23:49:32,929 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:49:34,939 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:49:53,453 WARN L193 SmtUtils]: Spent 11.75 s on a formula simplification. DAG size of input: 151 DAG size of output: 11 [2020-07-21 23:49:55,489 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:49:57,504 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:49:59,518 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:01,528 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:03,538 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:05,580 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:07,590 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:25,300 WARN L193 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 128 DAG size of output: 13 [2020-07-21 23:50:27,317 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:29,327 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:31,336 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:33,345 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:50:59,794 WARN L193 SmtUtils]: Spent 9.13 s on a formula simplification. DAG size of input: 116 DAG size of output: 11 [2020-07-21 23:51:01,891 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:51:03,899 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000)) is different from false [2020-07-21 23:51:05,908 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000)) is different from false [2020-07-21 23:51:35,373 WARN L193 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 103 DAG size of output: 13