/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 NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 12:07:26,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 12:07:26,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 12:07:26,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 12:07:26,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 12:07:26,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 12:07:26,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 12:07:26,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 12:07:26,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 12:07:26,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 12:07:26,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 12:07:26,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 12:07:26,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 12:07:26,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 12:07:26,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 12:07:26,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 12:07:26,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 12:07:26,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 12:07:26,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 12:07:26,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 12:07:26,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 12:07:26,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 12:07:26,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 12:07:26,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 12:07:26,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 12:07:26,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 12:07:26,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 12:07:26,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 12:07:26,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 12:07:26,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 12:07:26,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 12:07:26,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 12:07:26,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 12:07:26,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 12:07:26,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 12:07:26,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 12:07:26,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 12:07:26,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 12:07:26,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 12:07:26,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 12:07:26,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 12:07:26,278 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 12:07:26,294 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 12:07:26,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 12:07:26,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 12:07:26,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 12:07:26,296 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 12:07:26,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 12:07:26,296 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 12:07:26,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 12:07:26,298 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 12:07:26,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 12:07:26,298 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 12:07:26,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 12:07:26,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 12:07:26,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 12:07:26,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 12:07:26,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 12:07:26,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:07:26,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 12:07:26,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 12:07:26,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 12:07:26,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 12:07:26,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:07:26,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 12:07:26,301 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 12:07:26,301 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 -> NOT_INCREMENTALLY [2020-07-21 12:07:26,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 12:07:26,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 12:07:26,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 12:07:26,649 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 12:07:26,652 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 12:07:26,654 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-07-21 12:07:26,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0a0458d/c65410fc6cf249bb8d58f4fcfa5f74e2/FLAG3fc5b58bf [2020-07-21 12:07:27,312 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 12:07:27,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-07-21 12:07:27,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0a0458d/c65410fc6cf249bb8d58f4fcfa5f74e2/FLAG3fc5b58bf [2020-07-21 12:07:27,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0a0458d/c65410fc6cf249bb8d58f4fcfa5f74e2 [2020-07-21 12:07:27,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 12:07:27,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 12:07:27,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 12:07:27,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 12:07:27,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 12:07:27,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:27,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f717b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27, skipping insertion in model container [2020-07-21 12:07:27,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:27,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 12:07:27,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 12:07:27,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:07:27,906 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 12:07:27,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:07:27,946 INFO L208 MainTranslator]: Completed translation [2020-07-21 12:07:27,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27 WrapperNode [2020-07-21 12:07:27,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 12:07:27,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 12:07:27,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 12:07:27,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 12:07:27,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:27,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:27,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:27,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:28,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:28,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:28,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (1/1) ... [2020-07-21 12:07:28,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 12:07:28,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 12:07:28,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 12:07:28,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 12:07:28,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (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 12:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 12:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 12:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 12:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 12:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 12:07:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 12:07:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 12:07:28,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 12:07:28,415 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 12:07:28,416 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 12:07:28,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:07:28 BoogieIcfgContainer [2020-07-21 12:07:28,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 12:07:28,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 12:07:28,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 12:07:28,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 12:07:28,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:07:27" (1/3) ... [2020-07-21 12:07:28,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f60aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:07:28, skipping insertion in model container [2020-07-21 12:07:28,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:07:27" (2/3) ... [2020-07-21 12:07:28,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f60aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:07:28, skipping insertion in model container [2020-07-21 12:07:28,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:07:28" (3/3) ... [2020-07-21 12:07:28,430 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt5.c [2020-07-21 12:07:28,443 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 12:07:28,451 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 12:07:28,468 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 12:07:28,491 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 12:07:28,491 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 12:07:28,492 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 12:07:28,492 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 12:07:28,492 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 12:07:28,492 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 12:07:28,492 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 12:07:28,493 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 12:07:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-21 12:07:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-21 12:07:28,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:07:28,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:07:28,521 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:07:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:07:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 333887070, now seen corresponding path program 1 times [2020-07-21 12:07:28,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:07:28,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269977529] [2020-07-21 12:07:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:07:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:07:28,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 12:07:28,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:07:28,636 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 12:07:28,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:07:28,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269977529] [2020-07-21 12:07:28,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:07:28,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 12:07:28,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955517290] [2020-07-21 12:07:28,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 12:07:28,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:07:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 12:07:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 12:07:28,685 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-07-21 12:07:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:07:28,719 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-21 12:07:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 12:07:28,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-21 12:07:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:07:28,732 INFO L225 Difference]: With dead ends: 37 [2020-07-21 12:07:28,733 INFO L226 Difference]: Without dead ends: 18 [2020-07-21 12:07:28,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 12:07:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-21 12:07:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-21 12:07:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-21 12:07:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-07-21 12:07:28,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2020-07-21 12:07:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:07:28,784 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-21 12:07:28,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 12:07:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-21 12:07:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-21 12:07:28,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:07:28,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:07:29,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:07:29,002 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:07:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:07:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 309875524, now seen corresponding path program 1 times [2020-07-21 12:07:29,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:07:29,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115946933] [2020-07-21 12:07:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:07:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:07:29,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 12:07:29,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:07:29,148 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 12:07:29,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:07:29,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115946933] [2020-07-21 12:07:29,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:07:29,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:07:29,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337344700] [2020-07-21 12:07:29,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:07:29,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:07:29,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:07:29,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:07:29,154 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-07-21 12:07:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:07:29,263 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-21 12:07:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:07:29,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-21 12:07:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:07:29,265 INFO L225 Difference]: With dead ends: 34 [2020-07-21 12:07:29,265 INFO L226 Difference]: Without dead ends: 20 [2020-07-21 12:07:29,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:07:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-21 12:07:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-21 12:07:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-21 12:07:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-21 12:07:29,274 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2020-07-21 12:07:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:07:29,275 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-21 12:07:29,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:07:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-21 12:07:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-21 12:07:29,276 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:07:29,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:07:29,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:07:29,478 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:07:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:07:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1451693947, now seen corresponding path program 1 times [2020-07-21 12:07:29,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:07:29,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718106870] [2020-07-21 12:07:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:07:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:07:29,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-21 12:07:29,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:07:29,758 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 12:07:29,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:07:29,794 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 12:07:32,124 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 12:07:32,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718106870] [2020-07-21 12:07:32,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 12:07:32,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-21 12:07:32,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118885052] [2020-07-21 12:07:32,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-21 12:07:32,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:07:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-21 12:07:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=134, Unknown=1, NotChecked=0, Total=182 [2020-07-21 12:07:32,127 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 14 states. [2020-07-21 12:07:34,454 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 12 [2020-07-21 12:07:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:07:34,631 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2020-07-21 12:07:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 12:07:34,632 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-07-21 12:07:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:07:34,633 INFO L225 Difference]: With dead ends: 43 [2020-07-21 12:07:34,634 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 12:07:34,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=61, Invalid=178, Unknown=1, NotChecked=0, Total=240 [2020-07-21 12:07:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 12:07:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-21 12:07:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-21 12:07:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-21 12:07:34,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2020-07-21 12:07:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:07:34,642 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-21 12:07:34,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-21 12:07:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-21 12:07:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 12:07:34,644 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:07:34,644 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:07:34,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:07:34,858 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:07:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:07:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1035578608, now seen corresponding path program 1 times [2020-07-21 12:07:34,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:07:34,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351626173] [2020-07-21 12:07:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:07:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:07:34,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 12:07:34,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:07:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:07:34,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:07:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:07:43,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351626173] [2020-07-21 12:07:43,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 12:07:43,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-21 12:07:43,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64454605] [2020-07-21 12:07:43,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 12:07:43,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:07:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 12:07:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=31, Unknown=4, NotChecked=0, Total=56 [2020-07-21 12:07:43,260 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2020-07-21 12:07:45,406 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296)) (< 0 (mod (mod (mod (+ c_main_~l~0 1) 4294967296) 5) 4294967296))) is different from false [2020-07-21 12:08:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:08:43,382 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2020-07-21 12:08:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 12:08:43,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-07-21 12:08:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:08:43,441 INFO L225 Difference]: With dead ends: 54 [2020-07-21 12:08:43,441 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 12:08:43,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=23, Invalid=32, Unknown=5, NotChecked=12, Total=72 [2020-07-21 12:08:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 12:08:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-07-21 12:08:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 12:08:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-07-21 12:08:43,451 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2020-07-21 12:08:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:08:43,452 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-21 12:08:43,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 12:08:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-07-21 12:08:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 12:08:43,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:08:43,453 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:08:43,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:08:43,654 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:08:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:08:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2020075371, now seen corresponding path program 1 times [2020-07-21 12:08:43,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:08:43,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241349951] [2020-07-21 12:08:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:08:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:08:43,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-21 12:08:43,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:08:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:08:44,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:08:44,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 12:08:48,460 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_main_~l~0 1)) (.cse0 (= 0 (mod (mod c_main_~l~0 4294967296) 5))) (.cse1 (mod c_main_~l~0 4294967296))) (or (and (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296)) (not .cse0) (< .cse1 0)) (< (mod .cse2 4294967296) (mod c_main_~n~0 4294967296)) (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod .cse2 4294967296)) (and (or .cse0 (<= 0 .cse1)) (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296))))) is different from true [2020-07-21 12:08:50,540 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_main_~l~0 4294967296))) (let ((.cse3 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296))) (.cse0 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 5))) (.cse1 (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod (+ c_main_~l~0 1) 4294967296))) (.cse6 (<= 0 .cse7)) (.cse5 (< .cse7 0)) (.cse2 (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)) (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not .cse4) .cse1 .cse2 .cse3) (or .cse1 .cse5 .cse2 .cse3) (or .cse0 .cse4 .cse1 .cse6 .cse2) (or .cse4 .cse1 .cse6 .cse5 .cse2)))) is different from false [2020-07-21 12:08:52,634 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_main_~l~0 4294967296))) (let ((.cse3 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296))) (.cse0 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 5))) (.cse1 (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod (+ c_main_~l~0 1) 4294967296))) (.cse6 (<= 0 .cse7)) (.cse5 (< .cse7 0)) (.cse2 (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)) (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not .cse4) .cse1 .cse2 .cse3) (or .cse1 .cse5 .cse2 .cse3) (or .cse0 .cse4 .cse1 .cse6 .cse2) (or .cse4 .cse1 .cse6 .cse5 .cse2)))) is different from true [2020-07-21 12:09:09,410 WARN L193 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2020-07-21 12:09:19,856 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:09:34,411 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:09:53,086 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:09:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 4 times theorem prover too weak. 0 trivial. 5 not checked. [2020-07-21 12:09:53,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241349951] [2020-07-21 12:09:53,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 12:09:53,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2020-07-21 12:09:53,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448944793] [2020-07-21 12:09:53,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 12:09:53,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:09:53,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 12:09:53,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=314, Unknown=26, NotChecked=78, Total=506 [2020-07-21 12:09:53,119 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 23 states. [2020-07-21 12:11:11,926 WARN L193 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-07-21 12:11:16,208 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_main_~l~0 4294967296)) (.cse0 (+ c_main_~l~0 1))) (let ((.cse4 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296))) (.cse1 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (.cse5 (= 0 (mod (mod c_main_~l~0 4294967296) 5))) (.cse2 (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod .cse0 4294967296))) (.cse7 (<= 0 .cse8)) (.cse6 (< .cse8 0)) (.cse3 (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)) (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)))))) (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (= 0 (mod (mod (mod .cse0 4294967296) 5) 4294967296)) (forall ((v_prenex_2 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_2 4294967296)) (<= (mod v_prenex_2 4294967296) (mod (+ c_main_~l~0 1) 4294967296))))) (or .cse1 .cse2 .cse3 .cse4) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296) (mod c_main_~l~0 4294967296)) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) (or (not .cse5) .cse2 .cse3 .cse4) (or .cse2 .cse6 .cse3 .cse4) (or .cse1 .cse5 .cse2 .cse7 .cse3) (or .cse5 .cse2 .cse7 .cse6 .cse3)))) is different from false [2020-07-21 12:12:18,115 WARN L193 SmtUtils]: Spent 38.42 s on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-07-21 12:12:48,035 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 12:12:56,514 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 1))) (and (or (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296)) (= 0 (mod (mod (mod .cse0 4294967296) 5) 4294967296)) (forall ((v_prenex_2 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_2 4294967296)) (<= (mod v_prenex_2 4294967296) (mod (+ c_main_~l~0 1) 4294967296))))) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296) (mod .cse0 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296))))) is different from true [2020-07-21 12:13:11,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_main_~l~0 4294967296))) (let ((.cse3 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296))) (.cse0 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 5))) (.cse1 (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod (+ c_main_~l~0 1) 4294967296))) (.cse6 (<= 0 .cse7)) (.cse5 (< .cse7 0)) (.cse2 (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)) (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296) (mod c_main_~l~0 4294967296)) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) (or (not .cse4) .cse1 .cse2 .cse3) (or .cse1 .cse5 .cse2 .cse3) (or .cse0 .cse4 .cse1 .cse6 .cse2) (or .cse4 .cse1 .cse6 .cse5 .cse2)))) is different from false [2020-07-21 12:13:56,300 WARN L193 SmtUtils]: Spent 12.91 s on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-07-21 12:15:29,395 WARN L193 SmtUtils]: Spent 8.52 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 12:15:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:54,869 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2020-07-21 12:15:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-21 12:15:54,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2020-07-21 12:15:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:54,876 INFO L225 Difference]: With dead ends: 73 [2020-07-21 12:15:54,876 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 12:15:54,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 308.4s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=74, NotChecked=280, Total=1056 [2020-07-21 12:15:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 12:15:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-21 12:15:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-21 12:15:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2020-07-21 12:15:54,886 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 27 [2020-07-21 12:15:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:54,886 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2020-07-21 12:15:54,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 12:15:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2020-07-21 12:15:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-21 12:15:54,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:54,888 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:55,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:55,102 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1204685030, now seen corresponding path program 1 times [2020-07-21 12:15:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:55,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797829278] [2020-07-21 12:15:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:15:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:55,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-21 12:15:55,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:55,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:15:55,720 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 12:16:02,558 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 2)) (.cse2 (mod c_main_~l~0 4294967296)) (.cse1 (= 0 (mod (mod c_main_~l~0 4294967296) 5)))) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296) (mod .cse0 4294967296)) (and (not .cse1) (< .cse2 0) (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296)) (and (or (<= 0 .cse2) .cse1) (= (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296) 0)))) is different from true [2020-07-21 12:16:43,240 WARN L193 SmtUtils]: Spent 17.09 s on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-07-21 12:16:56,104 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 39 [2020-07-21 12:17:17,378 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:17:28,153 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 39 [2020-07-21 12:17:45,214 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:18:06,550 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 12:18:34,246 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 37 [2020-07-21 12:18:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 11 times theorem prover too weak. 0 trivial. 4 not checked. [2020-07-21 12:18:34,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [797829278] [2020-07-21 12:18:34,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 12:18:34,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2020-07-21 12:18:34,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143187398] [2020-07-21 12:18:34,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-21 12:18:34,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:18:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-21 12:18:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=656, Unknown=58, NotChecked=56, Total=930 [2020-07-21 12:18:34,278 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 31 states. [2020-07-21 12:18:36,861 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_main_~l~0 1)) (.cse3 (+ c_main_~l~0 3))) (let ((.cse0 (mod .cse3 4294967296)) (.cse7 (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (.cse1 (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296))))) (.cse2 (= 0 (mod (mod (mod .cse4 4294967296) 5) 4294967296))) (.cse6 (+ c_main_~l~0 2)) (.cse5 (mod c_main_~n~0 4294967296))) (and (or (= .cse0 (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296)) .cse1 .cse2) (or (= 0 (mod (mod (mod .cse3 4294967296) 5) 4294967296)) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 3) 4294967296)) (< (mod (+ c_main_~l~0 5) 4294967296) (mod main_~n~0 4294967296)))) (= (mod (+ c_main_~l~0 5) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296))) (or (< (mod .cse4 4294967296) .cse5) (= (mod .cse4 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296))) (or (= (mod (mod (mod .cse6 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296)))) (= .cse7 (mod (+ c_main_~l~0 4) 4294967296))) (or (= .cse0 .cse7) .cse1 .cse2) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296) (mod .cse6 4294967296)) (< (mod .cse6 4294967296) .cse5))))) is different from false [2020-07-21 12:18:38,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 2)) (.cse2 (+ c_main_~l~0 1)) (.cse1 (mod c_main_~n~0 4294967296))) (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296) (mod (+ c_main_~l~0 4) 4294967296)) (= (mod (mod (mod .cse0 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296))))) (or (< (mod c_main_~l~0 4294967296) .cse1) (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296)) (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))) (or (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= 0 (mod (mod (mod .cse2 4294967296) 5) 4294967296))) (or (= (mod .cse2 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296)) (< (mod .cse2 4294967296) .cse1)))) is different from false [2020-07-21 12:18:41,114 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 2)) (.cse4 (+ c_main_~l~0 1)) (.cse3 (mod c_main_~n~0 4294967296))) (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296) (mod (+ c_main_~l~0 4) 4294967296)) (= (mod (mod (mod .cse0 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296))))) (let ((.cse2 (mod c_main_~l~0 4294967296)) (.cse1 (= 0 (mod (mod c_main_~l~0 4294967296) 5)))) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296) (mod .cse0 4294967296)) (and (not .cse1) (< .cse2 0) (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 5) 4294967291) 4294967296))) (< (mod .cse0 4294967296) .cse3) (and (or (<= 0 .cse2) .cse1) (= (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296) 0)))) (or (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= 0 (mod (mod (mod .cse4 4294967296) 5) 4294967296))) (or (= (mod .cse4 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 1) 4294967296)) (< (mod .cse4 4294967296) .cse3)))) is different from false [2020-07-21 12:18:43,245 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 2))) (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296) (mod .cse0 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296))) (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296) (mod (+ c_main_~l~0 4) 4294967296)) (= (mod (mod (mod .cse0 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296))))) (or (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= 0 (mod (mod (mod (+ c_main_~l~0 1) 4294967296) 5) 4294967296))))) is different from false [2020-07-21 12:19:10,816 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2020-07-21 12:19:19,323 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296) (mod (+ c_main_~l~0 4) 4294967296)) (= (mod (mod (mod (+ c_main_~l~0 2) 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296))))) (or (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= 0 (mod (mod (mod (+ c_main_~l~0 1) 4294967296) 5) 4294967296)))) is different from false [2020-07-21 12:19:21,419 WARN L860 $PredicateComparison]: unable to prove that (and (or (= (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 4) 4294967296) (mod (+ c_main_~l~0 4) 4294967296)) (= (mod (mod (mod (+ c_main_~l~0 2) 4294967296) 5) 4294967296) 0) (forall ((main_~n~0 Int)) (or (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (< (mod (+ c_main_~l~0 4) 4294967296) (mod main_~n~0 4294967296))))) (or (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 3) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= 0 (mod (mod (mod (+ c_main_~l~0 1) 4294967296) 5) 4294967296)))) is different from true [2020-07-21 12:21:08,267 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_main_~l~0 1))) (or (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296)) (= (mod .cse0 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0) 4294967296)))) (or (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~v4~0 c_main_~i~0 c_main_~j~0 c_main_~k~0 c_main_~v3~0 2) 4294967296)) (= 0 (mod (mod (mod c_main_~l~0 4294967296) 5) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)))))) is different from true