java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/dijkstra.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:15:12,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:15:12,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:15:12,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:15:12,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:15:12,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:15:12,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:15:12,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:15:12,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:15:12,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:15:12,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:15:12,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:15:12,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:15:12,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:15:12,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:15:12,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:15:12,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:15:12,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:15:12,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:15:12,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:15:12,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:15:12,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:15:12,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:15:12,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:15:12,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:15:12,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:15:12,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:15:12,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:15:12,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:15:12,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:15:12,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:15:12,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:15:12,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:15:12,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:15:12,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:15:12,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:15:12,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:15:12,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:15:12,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:15:12,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:15:12,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:15:12,548 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 [2019-09-03 20:15:12,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:15:12,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:15:12,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:15:12,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:15:12,564 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:15:12,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:15:12,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:15:12,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:15:12,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:15:12,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:15:12,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:15:12,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:15:12,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:15:12,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:15:12,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:15:12,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:15:12,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:15:12,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:15:12,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:15:12,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:15:12,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:15:12,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:15:12,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:15:12,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:15:12,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:15:12,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:15:12,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:15:12,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:15:12,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:15:12,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:15:12,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:15:12,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:15:12,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:15:12,616 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:15:12,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/dijkstra.c [2019-09-03 20:15:12,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d615b0d6/3bfe3a02494548578c7881c768b1b6ad/FLAG80c383fd8 [2019-09-03 20:15:13,112 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:15:13,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/dijkstra.c [2019-09-03 20:15:13,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d615b0d6/3bfe3a02494548578c7881c768b1b6ad/FLAG80c383fd8 [2019-09-03 20:15:13,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d615b0d6/3bfe3a02494548578c7881c768b1b6ad [2019-09-03 20:15:13,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:15:13,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:15:13,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:13,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:15:13,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:15:13,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13, skipping insertion in model container [2019-09-03 20:15:13,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:15:13,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:15:13,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:13,821 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:15:13,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:15:13,955 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:15:13,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13 WrapperNode [2019-09-03 20:15:13,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:15:13,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:15:13,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:15:13,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:15:13,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (1/1) ... [2019-09-03 20:15:13,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:15:14,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:15:14,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:15:14,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:15:14,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (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 [2019-09-03 20:15:14,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:15:14,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:15:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:15:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:15:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:15:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:15:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:15:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:15:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:15:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:15:14,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:15:14,294 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:15:14,294 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:15:14,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:14 BoogieIcfgContainer [2019-09-03 20:15:14,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:15:14,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:15:14,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:15:14,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:15:14,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:15:13" (1/3) ... [2019-09-03 20:15:14,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46afd1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:14, skipping insertion in model container [2019-09-03 20:15:14,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:15:13" (2/3) ... [2019-09-03 20:15:14,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46afd1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:15:14, skipping insertion in model container [2019-09-03 20:15:14,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:15:14" (3/3) ... [2019-09-03 20:15:14,305 INFO L109 eAbstractionObserver]: Analyzing ICFG dijkstra.c [2019-09-03 20:15:14,320 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:15:14,330 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:15:14,377 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:15:14,427 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:15:14,428 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:15:14,429 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:15:14,429 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:15:14,429 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:15:14,429 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:15:14,429 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:15:14,429 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:15:14,430 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:15:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-03 20:15:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:15:14,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,459 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -924511897, now seen corresponding path program 1 times [2019-09-03 20:15:14,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:15:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:15:14,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:15:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:15:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:15:14,586 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-09-03 20:15:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:14,616 INFO L93 Difference]: Finished difference Result 53 states and 89 transitions. [2019-09-03 20:15:14,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:15:14,617 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-03 20:15:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:14,626 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:15:14,626 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:15:14,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:15:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:15:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:15:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:15:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-09-03 20:15:14,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 11 [2019-09-03 20:15:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:14,676 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-09-03 20:15:14,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:15:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-09-03 20:15:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:15:14,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:14,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:14,678 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1477291671, now seen corresponding path program 1 times [2019-09-03 20:15:14,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:14,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:14,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:15:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:15:14,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:15:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:15:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:15:14,813 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 6 states. [2019-09-03 20:15:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:17,086 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2019-09-03 20:15:17,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:15:17,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 20:15:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:17,089 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:15:17,090 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:15:17,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:15:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:15:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-09-03 20:15:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:15:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-09-03 20:15:17,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 12 [2019-09-03 20:15:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:17,124 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-09-03 20:15:17,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:15:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-09-03 20:15:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:15:17,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:17,125 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:17,126 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2146000689, now seen corresponding path program 1 times [2019-09-03 20:15:17,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:17,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:17,138 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:17,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:17,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:15:17,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:15:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:17,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:15:17,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:15:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:15:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:15:17,325 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 8 states. [2019-09-03 20:15:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:19,694 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2019-09-03 20:15:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:15:19,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-09-03 20:15:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:19,700 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:15:19,700 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:15:19,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:15:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:15:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:15:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:15:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2019-09-03 20:15:19,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 17 [2019-09-03 20:15:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:19,724 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-09-03 20:15:19,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:15:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2019-09-03 20:15:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:15:19,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:19,725 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:19,726 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1275165172, now seen corresponding path program 1 times [2019-09-03 20:15:19,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:19,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:19,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:19,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:19,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:19,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:19,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:15:19,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:15:19,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:19,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:15:19,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:15:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:15:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:15:19,876 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 9 states. [2019-09-03 20:15:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:20,515 INFO L93 Difference]: Finished difference Result 124 states and 179 transitions. [2019-09-03 20:15:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:15:20,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-03 20:15:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:20,518 INFO L225 Difference]: With dead ends: 124 [2019-09-03 20:15:20,518 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:15:20,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:15:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:15:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-09-03 20:15:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:15:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2019-09-03 20:15:20,540 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 19 [2019-09-03 20:15:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:20,540 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2019-09-03 20:15:20,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:15:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2019-09-03 20:15:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:15:20,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:20,542 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:20,542 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1686693655, now seen corresponding path program 1 times [2019-09-03 20:15:20,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:20,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:20,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:20,550 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:20,551 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:20,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:20,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:20,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:15:20,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:15:20,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:15:20,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:15:20,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:15:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:15:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:15:20,610 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 5 states. [2019-09-03 20:15:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:22,719 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2019-09-03 20:15:22,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:15:22,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-03 20:15:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:22,721 INFO L225 Difference]: With dead ends: 114 [2019-09-03 20:15:22,722 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 20:15:22,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:15:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 20:15:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-03 20:15:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 20:15:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2019-09-03 20:15:22,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 22 [2019-09-03 20:15:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:22,739 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2019-09-03 20:15:22,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:15:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2019-09-03 20:15:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:15:22,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:22,741 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:22,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash -929391143, now seen corresponding path program 2 times [2019-09-03 20:15:22,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:22,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:22,749 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:22,750 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:22,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:15:22,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:15:22,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:22,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:15:22,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:15:22,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:22,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:15:22,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:15:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:15:22,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:15:22,915 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 10 states. [2019-09-03 20:15:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:23,601 INFO L93 Difference]: Finished difference Result 170 states and 244 transitions. [2019-09-03 20:15:23,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:15:23,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-09-03 20:15:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:23,605 INFO L225 Difference]: With dead ends: 170 [2019-09-03 20:15:23,605 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:15:23,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:15:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:15:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-09-03 20:15:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:15:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2019-09-03 20:15:23,629 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 21 [2019-09-03 20:15:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:23,629 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2019-09-03 20:15:23,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:15:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2019-09-03 20:15:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:15:23,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:23,631 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:23,631 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2089132930, now seen corresponding path program 3 times [2019-09-03 20:15:23,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:23,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:23,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:23,639 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:23,640 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:23,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:23,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:15:23,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:15:23,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:15:23,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:15:23,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:15:23,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:23,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-03 20:15:23,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:15:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:15:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:15:23,759 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand 8 states. [2019-09-03 20:15:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:24,344 INFO L93 Difference]: Finished difference Result 142 states and 194 transitions. [2019-09-03 20:15:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:15:24,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-09-03 20:15:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:24,347 INFO L225 Difference]: With dead ends: 142 [2019-09-03 20:15:24,347 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:15:24,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:15:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:15:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 20:15:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:15:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2019-09-03 20:15:24,370 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 23 [2019-09-03 20:15:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:24,370 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2019-09-03 20:15:24,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:15:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2019-09-03 20:15:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:15:24,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:24,373 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:24,373 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1226102064, now seen corresponding path program 1 times [2019-09-03 20:15:24,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:24,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:24,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:15:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:24,382 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:24,382 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:24,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:15:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:24,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:15:24,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:24,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:15:24,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:24,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:15:24,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:15:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:15:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:15:24,643 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand 11 states. [2019-09-03 20:15:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:15:29,744 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2019-09-03 20:15:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:15:29,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-09-03 20:15:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:15:29,747 INFO L225 Difference]: With dead ends: 170 [2019-09-03 20:15:29,747 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:15:29,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:15:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:15:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-09-03 20:15:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 20:15:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2019-09-03 20:15:29,768 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 47 [2019-09-03 20:15:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:15:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2019-09-03 20:15:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:15:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2019-09-03 20:15:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:15:29,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:15:29,771 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:15:29,771 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:15:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:15:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1168843762, now seen corresponding path program 1 times [2019-09-03 20:15:29,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:15:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:15:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:29,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:15:29,778 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:15:29,778 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:15:29,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:15:29,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:15:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:15:29,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:15:29,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:15:29,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:15:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:15:34,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:15:34,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-03 20:15:34,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:15:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:15:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=11, Unknown=2, NotChecked=0, Total=20 [2019-09-03 20:15:34,489 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand 5 states. [2019-09-03 20:16:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:07,890 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2019-09-03 20:16:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:16:07,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-03 20:16:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:07,892 INFO L225 Difference]: With dead ends: 190 [2019-09-03 20:16:07,892 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:16:07,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=0, Total=42 [2019-09-03 20:16:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:16:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2019-09-03 20:16:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:16:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-09-03 20:16:07,904 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 47 [2019-09-03 20:16:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:07,904 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-09-03 20:16:07,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:16:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-09-03 20:16:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:16:07,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:07,906 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:07,906 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1531366091, now seen corresponding path program 2 times [2019-09-03 20:16:07,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:16:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:07,913 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:07,913 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:07,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:07,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:16:07,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:16:07,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:07,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:16:07,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:08,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:16:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:16:08,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:08,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-03 20:16:08,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:16:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:16:08,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:16:08,138 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 12 states. [2019-09-03 20:16:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:08,594 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2019-09-03 20:16:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:16:08,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-03 20:16:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:08,596 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:16:08,596 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:16:08,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:16:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:16:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-03 20:16:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 20:16:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2019-09-03 20:16:08,610 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 49 [2019-09-03 20:16:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:08,611 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2019-09-03 20:16:08,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:16:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2019-09-03 20:16:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:16:08,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:08,613 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:08,613 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash 125865928, now seen corresponding path program 3 times [2019-09-03 20:16:08,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:08,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:08,624 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:08,625 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:08,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:16:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:08,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:16:08,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:08,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:16:08,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:16:08,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:16:08,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:16:08,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:16:08,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:16:08,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:16:08,888 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand 11 states. [2019-09-03 20:16:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:16:09,834 INFO L93 Difference]: Finished difference Result 123 states and 156 transitions. [2019-09-03 20:16:09,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:16:09,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-03 20:16:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:16:09,837 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:16:09,837 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 20:16:09,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:16:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 20:16:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-03 20:16:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:16:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2019-09-03 20:16:09,849 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 52 [2019-09-03 20:16:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:16:09,850 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2019-09-03 20:16:09,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:16:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2019-09-03 20:16:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:16:09,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:16:09,851 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:16:09,852 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:16:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:16:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1462647386, now seen corresponding path program 4 times [2019-09-03 20:16:09,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:16:09,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:16:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:09,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:16:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:16:09,859 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:16:09,859 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:16:09,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:16:09,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:16:18,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:16:18,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:16:18,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:16:18,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:16:33,429 WARN L188 SmtUtils]: Spent 11.41 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-03 20:17:07,210 WARN L188 SmtUtils]: Spent 16.90 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-03 20:17:13,256 WARN L838 $PredicateComparison]: unable to prove that (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse0 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse0) (- 4)) 0) (= (+ (let ((.cse1 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse1 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse1 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse0 main_~n~0) (= (mod (* 3 (div (- .cse0) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0)))) is different from false [2019-09-03 20:17:15,259 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse0 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse0) (- 4)) 0) (= (+ (let ((.cse1 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse1 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse1 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse0 main_~n~0) (= (mod (* 3 (div (- .cse0) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0)))) is different from true [2019-09-03 20:17:33,363 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_main_~q~0 4))) (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= 0 (+ (let ((.cse0 (* 4 v_prenex_1))) (+ (+ (- (* (* c_main_~q~0 c_main_~p~0) c_main_~q~0)) (+ (* (* (* 4 v_prenex_2) c_main_~p~0) c_main_~q~0) (+ (* c_main_~p~0 (* v_prenex_1 v_prenex_1)) (- (* (* .cse0 v_prenex_2) c_main_~q~0))))) (* c_main_~r~0 (* .cse0 c_main_~q~0)))) (- (* (* (* 4 c_main_~p~0) c_main_~q~0) c_main_~r~0)))) (<= (div c_main_~q~0 4) v_prenex_2) (= (+ (* c_main_~p~0 c_main_~p~0) (* c_main_~q~0 c_main_~r~0)) (* c_main_~q~0 v_prenex_2)) (< v_prenex_2 c_main_~q~0))) (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse1 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse1) (- 4)) 0) (= (+ (let ((.cse2 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse2 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse2 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse1 main_~n~0) (= (mod (* 3 (div (- .cse1) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0)))) (= (mod c_main_~q~0 4) 0) (< c_main_~r~0 (+ (* 2 c_main_~p~0) c_main_~q~0)) (= (mod (* 3 .cse3) (- 4)) 0) (= (mod (* 3 (div (- .cse3) (- 4))) (- 4)) 0))) is different from false [2019-09-03 20:17:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:17:45,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (div (+ c_main_~h~0 (- c_main_~q~0)) 2)) (.cse7 (= 0 (mod (+ c_main_~h~0 c_main_~q~0) 2)))) (let ((.cse1 (not .cse7)) (.cse2 (< c_main_~h~0 c_main_~q~0)) (.cse3 (= c_main_~p~0 (+ .cse9 1))) (.cse5 (exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_main_~q~0_38 Int)) (let ((.cse15 (+ c_main_~h~0 (* (- 1) c_main_~q~0))) (.cse16 (div v_main_~q~0_38 4))) (and (= (mod v_main_~q~0_38 4) 0) (= (+ (* .cse15 .cse15) (* v_main_~q~0_38 c_main_~r~0)) (* v_main_~q~0_38 v_prenex_2)) (= (mod (* 3 (div (- .cse16) (- 4))) (- 4)) 0) (<= .cse16 v_prenex_2) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ (* 2 c_main_~h~0) v_main_~q~0_38)) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (= (mod (* 3 .cse16) (- 4)) 0) (= (+ (- (* (* v_main_~q~0_38 (+ (* 4 c_main_~h~0) (* (- 4) c_main_~q~0))) c_main_~r~0)) (let ((.cse17 (* 4 v_prenex_1))) (+ (* c_main_~r~0 (* v_main_~q~0_38 .cse17)) (+ (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse15))) (+ (* (* .cse15 (* 4 v_prenex_2)) v_main_~q~0_38) (+ (* .cse15 (* v_prenex_1 v_prenex_1)) (- (* (* .cse17 v_prenex_2) v_main_~q~0_38)))))))) 0) (= .cse16 c_main_~q~0))))) (.cse4 (exists ((v_prenex_3 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse14 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (= (+ (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44)))) (let ((.cse13 (* 4 v_prenex_3))) (+ (+ (+ (+ (- (* (* .cse13 main_~n~0) v_main_~q~0_BEFORE_CALL_43)) (* v_main_~p~0_BEFORE_CALL_44 (* v_prenex_3 v_prenex_3))) (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44))) (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44)))) (* v_main_~r~0_BEFORE_CALL_41 (* .cse13 v_main_~q~0_BEFORE_CALL_43))))) 0) (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse14) (- 4)) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse14 main_~n~0) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0))))) (.cse0 (exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_main_~q~0_38 Int)) (let ((.cse10 (+ c_main_~h~0 (* (- 1) c_main_~q~0))) (.cse11 (div v_main_~q~0_38 4))) (and (= (mod v_main_~q~0_38 4) 0) (= (+ (* .cse10 .cse10) (* v_main_~q~0_38 c_main_~r~0)) (* v_main_~q~0_38 v_prenex_2)) (= (mod (* 3 (div (- .cse11) (- 4))) (- 4)) 0) (<= .cse11 v_prenex_2) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ (* 2 c_main_~h~0) v_main_~q~0_38)) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (= (mod (* 3 .cse11) (- 4)) 0) (= (+ (- (* (* v_main_~q~0_38 (+ (* 4 c_main_~h~0) (* (- 4) c_main_~q~0))) c_main_~r~0)) (let ((.cse12 (* 4 v_prenex_1))) (+ (* c_main_~r~0 (* v_main_~q~0_38 .cse12)) (+ (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse10))) (+ (* (* .cse10 (* 4 v_prenex_2)) v_main_~q~0_38) (+ (* .cse10 (* v_prenex_1 v_prenex_1)) (- (* (* .cse12 v_prenex_2) v_main_~q~0_38)))))))) 0) (= .cse11 c_main_~q~0) (<= 0 v_main_~q~0_38))))) (.cse6 (= c_main_~p~0 .cse9)) (.cse8 (<= c_main_~q~0 c_main_~h~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7) (and .cse5 .cse6 .cse8 .cse4) (and .cse0 .cse6 .cse8)))) is different from false [2019-09-03 20:19:05,075 WARN L188 SmtUtils]: Spent 48.02 s on a formula simplification that was a NOOP. DAG size: 556 [2019-09-03 20:19:12,518 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse1 (+ v_prenex_4 (* (- 1) c_main_~q~0))) (.cse0 (+ v_prenex_4 c_main_~r~0)) (.cse2 (div v_prenex_7 4))) (and (<= 0 v_prenex_7) (= (* v_prenex_7 v_prenex_5) (+ (* .cse0 v_prenex_7) (* .cse1 .cse1))) (= (mod v_prenex_7 4) 0) (not (= v_prenex_7 1)) (= .cse2 c_main_~q~0) (= c_main_~p~0 (+ (div (+ v_prenex_4 (- c_main_~q~0)) 2) c_main_~q~0)) (= (+ (- (* .cse0 (* (+ (* 4 v_prenex_4) (* (- 4) c_main_~q~0)) v_prenex_7))) (let ((.cse3 (* 4 v_prenex_6))) (+ (+ (- (* (* .cse1 v_prenex_7) v_prenex_7)) (+ (* v_prenex_7 (* (* 4 v_prenex_5) .cse1)) (+ (* (* v_prenex_6 v_prenex_6) .cse1) (- (* (* .cse3 v_prenex_5) v_prenex_7))))) (* (* .cse3 v_prenex_7) .cse0)))) 0) (= 0 (mod (+ v_prenex_4 c_main_~q~0) 2)) (<= .cse2 v_prenex_5) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_7 v_prenex_4)) (= (mod (* 3 .cse2) (- 4)) 0) (= (mod (* 3 (div (- .cse2) (- 4))) (- 4)) 0) (< v_prenex_5 v_prenex_7)))) (and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_31 Int)) (let ((.cse4 (div v_prenex_27 4))) (and (= (mod v_prenex_27 4) 0) (= (mod (* 3 .cse4) (- 4)) 0) (= (mod (* 3 (div (- .cse4) (- 4))) (- 4)) 0) (= 0 (+ (- (* v_prenex_31 (* (* 4 v_prenex_34) v_prenex_27))) (let ((.cse5 (* 4 v_prenex_29))) (+ (+ (+ (+ (* (* v_prenex_29 v_prenex_29) v_prenex_34) (- (* (* v_prenex_33 .cse5) v_prenex_27))) (* (* v_prenex_34 (* 4 v_prenex_33)) v_prenex_27)) (- (* v_prenex_27 (* v_prenex_34 v_prenex_27)))) (* v_prenex_31 (* v_prenex_27 .cse5)))))) (< v_prenex_33 v_prenex_27) (< v_prenex_31 (+ v_prenex_27 (* 2 v_prenex_34))) (= (+ (* v_prenex_34 v_prenex_34) (* v_prenex_31 v_prenex_27)) (* v_prenex_33 v_prenex_27)) (<= .cse4 v_prenex_33)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_32 Int)) (let ((.cse6 (div v_prenex_26 4)) (.cse8 (+ v_prenex_32 (* (- 1) c_main_~q~0))) (.cse7 (+ v_prenex_32 c_main_~r~0))) (and (< v_prenex_28 v_prenex_26) (not (= v_prenex_26 1)) (<= c_main_~q~0 v_prenex_32) (= c_main_~p~0 (+ (div (+ v_prenex_32 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse6) (- 4))) (- 4)) 0) (= (mod v_prenex_26 4) 0) (= (+ (* .cse7 v_prenex_26) (* .cse8 .cse8)) (* v_prenex_28 v_prenex_26)) (<= .cse6 v_prenex_28) (= (mod (* 3 .cse6) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_26 v_prenex_32)) (= .cse6 c_main_~q~0) (= 0 (+ (let ((.cse9 (* 4 v_prenex_30))) (+ (+ (+ (+ (- (* v_prenex_26 (* .cse9 v_prenex_28))) (* .cse8 (* v_prenex_30 v_prenex_30))) (* v_prenex_26 (* .cse8 (* 4 v_prenex_28)))) (- (* (* .cse8 v_prenex_26) v_prenex_26))) (* .cse7 (* .cse9 v_prenex_26)))) (- (* (* v_prenex_26 (+ (* 4 v_prenex_32) (* (- 4) c_main_~q~0))) .cse7)))))))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse10 (div v_prenex_35 4)) (.cse11 (+ v_prenex_38 (* (- 1) c_main_~q~0))) (.cse12 (+ v_prenex_38 c_main_~r~0))) (and (= (mod (* 3 .cse10) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_38 v_prenex_35)) (<= .cse10 v_prenex_36) (= .cse10 c_main_~q~0) (= 0 (mod (+ v_prenex_38 c_main_~q~0) 2)) (= (+ (* .cse11 .cse11) (* .cse12 v_prenex_35)) (* v_prenex_36 v_prenex_35)) (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_38 (- c_main_~q~0)) 2))) (< v_prenex_36 v_prenex_35) (= (mod (* 3 (div (- .cse10) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= 0 (+ (- (* (* v_prenex_35 (+ (* 4 v_prenex_38) (* (- 4) c_main_~q~0))) .cse12)) (let ((.cse13 (* 4 v_prenex_37))) (+ (+ (- (* v_prenex_35 (* .cse11 v_prenex_35))) (+ (* v_prenex_35 (* .cse11 (* 4 v_prenex_36))) (+ (- (* v_prenex_35 (* v_prenex_36 .cse13))) (* (* v_prenex_37 v_prenex_37) .cse11)))) (* .cse12 (* v_prenex_35 .cse13)))))) (= (mod v_prenex_35 4) 0)))) (exists ((v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse14 (div v_prenex_17 4)) (.cse15 (+ v_prenex_23 (* (- 1) c_main_~q~0))) (.cse16 (+ v_prenex_23 c_main_~r~0))) (and (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_23 (- c_main_~q~0)) 2) 1)) (= (mod v_prenex_17 4) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_17 v_prenex_23)) (<= .cse14 v_prenex_19) (= (* v_prenex_17 v_prenex_19) (+ (* .cse15 .cse15) (* .cse16 v_prenex_17))) (not (= 0 (mod (+ v_prenex_23 c_main_~q~0) 2))) (= .cse14 c_main_~q~0) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (not (= v_prenex_17 1)) (= (mod (* 3 .cse14) (- 4)) 0) (< v_prenex_19 v_prenex_17) (= (+ (let ((.cse17 (* 4 v_prenex_21))) (+ (+ (+ (* (* .cse15 (* 4 v_prenex_19)) v_prenex_17) (+ (* (* v_prenex_21 v_prenex_21) .cse15) (- (* (* v_prenex_19 .cse17) v_prenex_17)))) (- (* v_prenex_17 (* v_prenex_17 .cse15)))) (* (* v_prenex_17 .cse17) .cse16))) (- (* .cse16 (* v_prenex_17 (+ (* 4 v_prenex_23) (* (- 4) c_main_~q~0)))))) 0) (< v_prenex_23 c_main_~q~0)))) (exists ((main_~h~0 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_main_~q~0_38 Int)) (let ((.cse18 (div v_main_~q~0_38 4)) (.cse19 (+ main_~h~0 c_main_~r~0)) (.cse20 (+ main_~h~0 (* (- 1) c_main_~q~0)))) (and (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ main_~h~0 v_main_~q~0_38)) (= c_main_~p~0 (+ (div (+ main_~h~0 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse18) (- 4))) (- 4)) 0) (= (+ (* v_main_~q~0_38 .cse19) (* .cse20 .cse20)) (* v_main_~q~0_38 v_prenex_2)) (= (mod (* 3 .cse18) (- 4)) 0) (= .cse18 c_main_~q~0) (= (mod v_main_~q~0_38 4) 0) (<= .cse18 v_prenex_2) (<= c_main_~q~0 main_~h~0) (= (+ (- (* (* v_main_~q~0_38 (+ (* 4 main_~h~0) (* (- 4) c_main_~q~0))) .cse19)) (let ((.cse21 (* 4 v_prenex_1))) (+ (* (* v_main_~q~0_38 .cse21) .cse19) (+ (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse20))) (+ (* (* .cse20 (* 4 v_prenex_2)) v_main_~q~0_38) (+ (* .cse20 (* v_prenex_1 v_prenex_1)) (- (* (* .cse21 v_prenex_2) v_main_~q~0_38)))))))) 0) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (<= 0 v_main_~q~0_38)))) (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_10 Int) (v_prenex_8 Int)) (let ((.cse22 (div v_prenex_10 4)) (.cse25 (+ (* (- 1) c_main_~q~0) v_prenex_8)) (.cse23 (+ c_main_~r~0 v_prenex_8))) (and (= c_main_~p~0 (+ (div (+ v_prenex_8 (- c_main_~q~0)) 2) c_main_~q~0 1)) (< v_prenex_12 v_prenex_10) (= (mod (* 3 .cse22) (- 4)) 0) (= .cse22 c_main_~q~0) (<= 0 v_prenex_10) (= (+ (let ((.cse24 (* 4 v_prenex_14))) (+ (* .cse23 (* v_prenex_10 .cse24)) (+ (- (* (* .cse25 v_prenex_10) v_prenex_10)) (+ (* (* .cse25 (* 4 v_prenex_12)) v_prenex_10) (+ (- (* (* v_prenex_12 .cse24) v_prenex_10)) (* .cse25 (* v_prenex_14 v_prenex_14))))))) (- (* .cse23 (* v_prenex_10 (+ (* (- 4) c_main_~q~0) (* 4 v_prenex_8)))))) 0) (<= .cse22 v_prenex_12) (= (mod v_prenex_10 4) 0) (= (mod (* 3 (div (- .cse22) (- 4))) (- 4)) 0) (< v_prenex_8 c_main_~q~0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_10 v_prenex_8)) (not (= 0 (mod (+ v_prenex_8 c_main_~q~0) 2))) (= (* v_prenex_12 v_prenex_10) (+ (* .cse25 .cse25) (* .cse23 v_prenex_10))) (not (= v_prenex_10 1)))))) is different from false [2019-09-03 20:19:14,525 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse1 (+ v_prenex_4 (* (- 1) c_main_~q~0))) (.cse0 (+ v_prenex_4 c_main_~r~0)) (.cse2 (div v_prenex_7 4))) (and (<= 0 v_prenex_7) (= (* v_prenex_7 v_prenex_5) (+ (* .cse0 v_prenex_7) (* .cse1 .cse1))) (= (mod v_prenex_7 4) 0) (not (= v_prenex_7 1)) (= .cse2 c_main_~q~0) (= c_main_~p~0 (+ (div (+ v_prenex_4 (- c_main_~q~0)) 2) c_main_~q~0)) (= (+ (- (* .cse0 (* (+ (* 4 v_prenex_4) (* (- 4) c_main_~q~0)) v_prenex_7))) (let ((.cse3 (* 4 v_prenex_6))) (+ (+ (- (* (* .cse1 v_prenex_7) v_prenex_7)) (+ (* v_prenex_7 (* (* 4 v_prenex_5) .cse1)) (+ (* (* v_prenex_6 v_prenex_6) .cse1) (- (* (* .cse3 v_prenex_5) v_prenex_7))))) (* (* .cse3 v_prenex_7) .cse0)))) 0) (= 0 (mod (+ v_prenex_4 c_main_~q~0) 2)) (<= .cse2 v_prenex_5) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_7 v_prenex_4)) (= (mod (* 3 .cse2) (- 4)) 0) (= (mod (* 3 (div (- .cse2) (- 4))) (- 4)) 0) (< v_prenex_5 v_prenex_7)))) (and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_31 Int)) (let ((.cse4 (div v_prenex_27 4))) (and (= (mod v_prenex_27 4) 0) (= (mod (* 3 .cse4) (- 4)) 0) (= (mod (* 3 (div (- .cse4) (- 4))) (- 4)) 0) (= 0 (+ (- (* v_prenex_31 (* (* 4 v_prenex_34) v_prenex_27))) (let ((.cse5 (* 4 v_prenex_29))) (+ (+ (+ (+ (* (* v_prenex_29 v_prenex_29) v_prenex_34) (- (* (* v_prenex_33 .cse5) v_prenex_27))) (* (* v_prenex_34 (* 4 v_prenex_33)) v_prenex_27)) (- (* v_prenex_27 (* v_prenex_34 v_prenex_27)))) (* v_prenex_31 (* v_prenex_27 .cse5)))))) (< v_prenex_33 v_prenex_27) (< v_prenex_31 (+ v_prenex_27 (* 2 v_prenex_34))) (= (+ (* v_prenex_34 v_prenex_34) (* v_prenex_31 v_prenex_27)) (* v_prenex_33 v_prenex_27)) (<= .cse4 v_prenex_33)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_32 Int)) (let ((.cse6 (div v_prenex_26 4)) (.cse8 (+ v_prenex_32 (* (- 1) c_main_~q~0))) (.cse7 (+ v_prenex_32 c_main_~r~0))) (and (< v_prenex_28 v_prenex_26) (not (= v_prenex_26 1)) (<= c_main_~q~0 v_prenex_32) (= c_main_~p~0 (+ (div (+ v_prenex_32 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse6) (- 4))) (- 4)) 0) (= (mod v_prenex_26 4) 0) (= (+ (* .cse7 v_prenex_26) (* .cse8 .cse8)) (* v_prenex_28 v_prenex_26)) (<= .cse6 v_prenex_28) (= (mod (* 3 .cse6) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_26 v_prenex_32)) (= .cse6 c_main_~q~0) (= 0 (+ (let ((.cse9 (* 4 v_prenex_30))) (+ (+ (+ (+ (- (* v_prenex_26 (* .cse9 v_prenex_28))) (* .cse8 (* v_prenex_30 v_prenex_30))) (* v_prenex_26 (* .cse8 (* 4 v_prenex_28)))) (- (* (* .cse8 v_prenex_26) v_prenex_26))) (* .cse7 (* .cse9 v_prenex_26)))) (- (* (* v_prenex_26 (+ (* 4 v_prenex_32) (* (- 4) c_main_~q~0))) .cse7)))))))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse10 (div v_prenex_35 4)) (.cse11 (+ v_prenex_38 (* (- 1) c_main_~q~0))) (.cse12 (+ v_prenex_38 c_main_~r~0))) (and (= (mod (* 3 .cse10) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_38 v_prenex_35)) (<= .cse10 v_prenex_36) (= .cse10 c_main_~q~0) (= 0 (mod (+ v_prenex_38 c_main_~q~0) 2)) (= (+ (* .cse11 .cse11) (* .cse12 v_prenex_35)) (* v_prenex_36 v_prenex_35)) (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_38 (- c_main_~q~0)) 2))) (< v_prenex_36 v_prenex_35) (= (mod (* 3 (div (- .cse10) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= 0 (+ (- (* (* v_prenex_35 (+ (* 4 v_prenex_38) (* (- 4) c_main_~q~0))) .cse12)) (let ((.cse13 (* 4 v_prenex_37))) (+ (+ (- (* v_prenex_35 (* .cse11 v_prenex_35))) (+ (* v_prenex_35 (* .cse11 (* 4 v_prenex_36))) (+ (- (* v_prenex_35 (* v_prenex_36 .cse13))) (* (* v_prenex_37 v_prenex_37) .cse11)))) (* .cse12 (* v_prenex_35 .cse13)))))) (= (mod v_prenex_35 4) 0)))) (exists ((v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse14 (div v_prenex_17 4)) (.cse15 (+ v_prenex_23 (* (- 1) c_main_~q~0))) (.cse16 (+ v_prenex_23 c_main_~r~0))) (and (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_23 (- c_main_~q~0)) 2) 1)) (= (mod v_prenex_17 4) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_17 v_prenex_23)) (<= .cse14 v_prenex_19) (= (* v_prenex_17 v_prenex_19) (+ (* .cse15 .cse15) (* .cse16 v_prenex_17))) (not (= 0 (mod (+ v_prenex_23 c_main_~q~0) 2))) (= .cse14 c_main_~q~0) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (not (= v_prenex_17 1)) (= (mod (* 3 .cse14) (- 4)) 0) (< v_prenex_19 v_prenex_17) (= (+ (let ((.cse17 (* 4 v_prenex_21))) (+ (+ (+ (* (* .cse15 (* 4 v_prenex_19)) v_prenex_17) (+ (* (* v_prenex_21 v_prenex_21) .cse15) (- (* (* v_prenex_19 .cse17) v_prenex_17)))) (- (* v_prenex_17 (* v_prenex_17 .cse15)))) (* (* v_prenex_17 .cse17) .cse16))) (- (* .cse16 (* v_prenex_17 (+ (* 4 v_prenex_23) (* (- 4) c_main_~q~0)))))) 0) (< v_prenex_23 c_main_~q~0)))) (exists ((main_~h~0 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_main_~q~0_38 Int)) (let ((.cse18 (div v_main_~q~0_38 4)) (.cse19 (+ main_~h~0 c_main_~r~0)) (.cse20 (+ main_~h~0 (* (- 1) c_main_~q~0)))) (and (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ main_~h~0 v_main_~q~0_38)) (= c_main_~p~0 (+ (div (+ main_~h~0 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse18) (- 4))) (- 4)) 0) (= (+ (* v_main_~q~0_38 .cse19) (* .cse20 .cse20)) (* v_main_~q~0_38 v_prenex_2)) (= (mod (* 3 .cse18) (- 4)) 0) (= .cse18 c_main_~q~0) (= (mod v_main_~q~0_38 4) 0) (<= .cse18 v_prenex_2) (<= c_main_~q~0 main_~h~0) (= (+ (- (* (* v_main_~q~0_38 (+ (* 4 main_~h~0) (* (- 4) c_main_~q~0))) .cse19)) (let ((.cse21 (* 4 v_prenex_1))) (+ (* (* v_main_~q~0_38 .cse21) .cse19) (+ (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse20))) (+ (* (* .cse20 (* 4 v_prenex_2)) v_main_~q~0_38) (+ (* .cse20 (* v_prenex_1 v_prenex_1)) (- (* (* .cse21 v_prenex_2) v_main_~q~0_38)))))))) 0) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (<= 0 v_main_~q~0_38)))) (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_10 Int) (v_prenex_8 Int)) (let ((.cse22 (div v_prenex_10 4)) (.cse25 (+ (* (- 1) c_main_~q~0) v_prenex_8)) (.cse23 (+ c_main_~r~0 v_prenex_8))) (and (= c_main_~p~0 (+ (div (+ v_prenex_8 (- c_main_~q~0)) 2) c_main_~q~0 1)) (< v_prenex_12 v_prenex_10) (= (mod (* 3 .cse22) (- 4)) 0) (= .cse22 c_main_~q~0) (<= 0 v_prenex_10) (= (+ (let ((.cse24 (* 4 v_prenex_14))) (+ (* .cse23 (* v_prenex_10 .cse24)) (+ (- (* (* .cse25 v_prenex_10) v_prenex_10)) (+ (* (* .cse25 (* 4 v_prenex_12)) v_prenex_10) (+ (- (* (* v_prenex_12 .cse24) v_prenex_10)) (* .cse25 (* v_prenex_14 v_prenex_14))))))) (- (* .cse23 (* v_prenex_10 (+ (* (- 4) c_main_~q~0) (* 4 v_prenex_8)))))) 0) (<= .cse22 v_prenex_12) (= (mod v_prenex_10 4) 0) (= (mod (* 3 (div (- .cse22) (- 4))) (- 4)) 0) (< v_prenex_8 c_main_~q~0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_10 v_prenex_8)) (not (= 0 (mod (+ v_prenex_8 c_main_~q~0) 2))) (= (* v_prenex_12 v_prenex_10) (+ (* .cse25 .cse25) (* .cse23 v_prenex_10))) (not (= v_prenex_10 1)))))) is different from true [2019-09-03 20:19:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:16,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-03 20:19:27,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-03 20:20:05,393 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c___VERIFIER_assert_#in~cond| 0)) (.cse0 (= |c___VERIFIER_assert_#in~cond| 1))) (or .cse0 (and .cse1 (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_32 Int) (v_main_~r~0_BEFORE_CALL_42 Int)) (let ((.cse5 (div v_prenex_26 4))) (let ((.cse4 (+ v_main_~r~0_BEFORE_CALL_42 v_prenex_32)) (.cse2 (+ (* (- 1) .cse5) v_prenex_32)) (.cse6 (* 3 .cse5))) (and (< v_prenex_28 v_prenex_26) (= (+ (let ((.cse3 (* 4 v_prenex_30))) (+ (+ (- (* (* .cse2 v_prenex_26) v_prenex_26)) (+ (* (* .cse2 (* 4 v_prenex_28)) v_prenex_26) (+ (* .cse2 (* v_prenex_30 v_prenex_30)) (- (* v_prenex_26 (* .cse3 v_prenex_28)))))) (* .cse4 (* .cse3 v_prenex_26)))) (- (* .cse4 (* (+ (* (- 4) .cse5) (* 4 v_prenex_32)) v_prenex_26)))) 0) (<= (+ .cse6 (* 2 (div .cse2 2))) v_main_~r~0_BEFORE_CALL_42) (not (= v_prenex_26 1)) (= (mod (* 3 (div (- .cse5) (- 4))) (- 4)) 0) (< (+ (* 2 .cse5) v_main_~r~0_BEFORE_CALL_42) (+ v_prenex_26 v_prenex_32)) (= (mod v_prenex_26 4) 0) (<= .cse5 v_prenex_28) (= (+ (* .cse4 v_prenex_26) (* .cse2 .cse2)) (* v_prenex_28 v_prenex_26)) (= (mod .cse6 (- 4)) 0) (<= .cse5 v_prenex_32)))))) (and .cse0 (exists ((v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_21 Int) (v_main_~r~0_BEFORE_CALL_42 Int) (v_prenex_19 Int)) (let ((.cse10 (div v_prenex_17 4))) (let ((.cse9 (+ v_prenex_23 v_main_~r~0_BEFORE_CALL_42)) (.cse7 (+ v_prenex_23 (* (- 1) .cse10))) (.cse11 (* 3 .cse10))) (and (= (+ (let ((.cse8 (* 4 v_prenex_21))) (+ (+ (+ (+ (* .cse7 (* v_prenex_21 v_prenex_21)) (- (* (* v_prenex_19 .cse8) v_prenex_17))) (* v_prenex_17 (* .cse7 (* 4 v_prenex_19)))) (- (* (* .cse7 v_prenex_17) v_prenex_17))) (* (* v_prenex_17 .cse8) .cse9))) (- (* (* v_prenex_17 (+ (* 4 v_prenex_23) (* (- 4) .cse10))) .cse9))) 0) (< (+ (* 2 .cse10) v_main_~r~0_BEFORE_CALL_42) (+ v_prenex_17 v_prenex_23)) (not (= 0 (mod (+ v_prenex_23 .cse10) 2))) (= (mod (* 3 (div (- .cse10) (- 4))) (- 4)) 0) (= (+ (* .cse7 .cse7) (* v_prenex_17 .cse9)) (* v_prenex_17 v_prenex_19)) (< v_main_~r~0_BEFORE_CALL_42 (+ .cse11 (* 2 (div .cse7 2)) 2)) (not (= v_prenex_17 1)) (= (mod v_prenex_17 4) 0) (<= .cse10 v_prenex_19) (= (mod .cse11 (- 4)) 0) (< v_prenex_23 .cse10) (< v_prenex_19 v_prenex_17)))))) (and .cse0 (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_10 Int) (v_main_~r~0_BEFORE_CALL_42 Int) (v_prenex_8 Int)) (let ((.cse14 (div v_prenex_10 4))) (let ((.cse15 (* 3 .cse14)) (.cse13 (+ v_main_~r~0_BEFORE_CALL_42 v_prenex_8)) (.cse12 (+ (* (- 1) .cse14) v_prenex_8))) (and (= (* v_prenex_12 v_prenex_10) (+ (* .cse12 .cse12) (* v_prenex_10 .cse13))) (< v_prenex_12 v_prenex_10) (< v_prenex_8 .cse14) (< (+ (* 2 .cse14) v_main_~r~0_BEFORE_CALL_42) (+ v_prenex_10 v_prenex_8)) (= (mod .cse15 (- 4)) 0) (<= 0 v_prenex_10) (< v_main_~r~0_BEFORE_CALL_42 (+ .cse15 (* 2 (div .cse12 2)) 2)) (<= .cse14 v_prenex_12) (= (mod v_prenex_10 4) 0) (not (= (mod (+ .cse14 v_prenex_8) 2) 0)) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (= (+ (- (* (* (+ (* (- 4) .cse14) (* 4 v_prenex_8)) v_prenex_10) .cse13)) (let ((.cse16 (* 4 v_prenex_14))) (+ (* (* v_prenex_10 .cse16) .cse13) (+ (+ (+ (- (* (* v_prenex_12 .cse16) v_prenex_10)) (* .cse12 (* v_prenex_14 v_prenex_14))) (* (* .cse12 (* 4 v_prenex_12)) v_prenex_10)) (- (* (* .cse12 v_prenex_10) v_prenex_10)))))) 0) (not (= v_prenex_10 1))))))) (and .cse1 (exists ((main_~h~0 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_main_~r~0_BEFORE_CALL_42 Int) (v_main_~q~0_38 Int)) (let ((.cse19 (div v_main_~q~0_38 4))) (let ((.cse18 (+ main_~h~0 v_main_~r~0_BEFORE_CALL_42)) (.cse21 (* 3 .cse19)) (.cse17 (+ main_~h~0 (* (- 1) .cse19)))) (and (= (mod v_main_~q~0_38 4) 0) (= (+ (* .cse17 .cse17) (* v_main_~q~0_38 .cse18)) (* v_main_~q~0_38 v_prenex_2)) (<= .cse19 main_~h~0) (= (mod (* 3 (div (- .cse19) (- 4))) (- 4)) 0) (<= .cse19 v_prenex_2) (< (+ v_main_~r~0_BEFORE_CALL_42 (* 2 .cse19)) (+ main_~h~0 v_main_~q~0_38)) (= 0 (+ (let ((.cse20 (* 4 v_prenex_1))) (+ (+ (+ (* v_main_~q~0_38 (* (* 4 v_prenex_2) .cse17)) (+ (- (* (* .cse20 v_prenex_2) v_main_~q~0_38)) (* .cse17 (* v_prenex_1 v_prenex_1)))) (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse17)))) (* .cse18 (* v_main_~q~0_38 .cse20)))) (- (* .cse18 (* v_main_~q~0_38 (+ (* 4 main_~h~0) (* (- 4) .cse19))))))) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (= (mod .cse21 (- 4)) 0) (<= 0 v_main_~q~0_38) (<= (+ .cse21 (* 2 (div .cse17 2))) v_main_~r~0_BEFORE_CALL_42)))))) (and .cse0 (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_main_~r~0_BEFORE_CALL_42 Int)) (let ((.cse25 (div v_prenex_35 4))) (let ((.cse23 (* 3 .cse25)) (.cse22 (+ v_prenex_38 (* (- 1) .cse25))) (.cse24 (+ v_prenex_38 v_main_~r~0_BEFORE_CALL_42))) (and (< v_main_~r~0_BEFORE_CALL_42 (+ (* 2 (div .cse22 2)) .cse23)) (= (* v_prenex_36 v_prenex_35) (+ (* .cse24 v_prenex_35) (* .cse22 .cse22))) (= (mod .cse23 (- 4)) 0) (< (+ v_main_~r~0_BEFORE_CALL_42 (* 2 .cse25)) (+ v_prenex_38 v_prenex_35)) (<= .cse25 v_prenex_36) (= (+ (- (* .cse24 (* (+ (* 4 v_prenex_38) (* (- 4) .cse25)) v_prenex_35))) (let ((.cse26 (* 4 v_prenex_37))) (+ (+ (- (* (* .cse22 v_prenex_35) v_prenex_35)) (+ (* v_prenex_35 (* .cse22 (* 4 v_prenex_36))) (+ (* (* v_prenex_37 v_prenex_37) .cse22) (- (* v_prenex_35 (* v_prenex_36 .cse26)))))) (* .cse24 (* v_prenex_35 .cse26))))) 0) (< v_prenex_36 v_prenex_35) (= (mod (* 3 (div (- .cse25) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= (mod (+ v_prenex_38 .cse25) 2) 0) (= (mod v_prenex_35 4) 0)))))) (and .cse1 (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_main_~r~0_BEFORE_CALL_42 Int)) (let ((.cse30 (div v_prenex_35 4))) (let ((.cse29 (* 3 .cse30)) (.cse28 (+ v_prenex_38 (* (- 1) .cse30))) (.cse27 (+ v_prenex_38 v_main_~r~0_BEFORE_CALL_42))) (and (= (* v_prenex_36 v_prenex_35) (+ (* .cse27 v_prenex_35) (* .cse28 .cse28))) (<= (+ (* 2 (div .cse28 2)) .cse29) v_main_~r~0_BEFORE_CALL_42) (= (mod .cse29 (- 4)) 0) (< (+ v_main_~r~0_BEFORE_CALL_42 (* 2 .cse30)) (+ v_prenex_38 v_prenex_35)) (<= .cse30 v_prenex_36) (= (+ (- (* .cse27 (* (+ (* 4 v_prenex_38) (* (- 4) .cse30)) v_prenex_35))) (let ((.cse31 (* 4 v_prenex_37))) (+ (+ (- (* (* .cse28 v_prenex_35) v_prenex_35)) (+ (* v_prenex_35 (* .cse28 (* 4 v_prenex_36))) (+ (* (* v_prenex_37 v_prenex_37) .cse28) (- (* v_prenex_35 (* v_prenex_36 .cse31)))))) (* .cse27 (* v_prenex_35 .cse31))))) 0) (< v_prenex_36 v_prenex_35) (= (mod (* 3 (div (- .cse30) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= (mod (+ v_prenex_38 .cse30) 2) 0) (= (mod v_prenex_35 4) 0)))))) (and .cse0 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_main_~r~0_BEFORE_CALL_42 Int)) (let ((.cse35 (div v_prenex_7 4))) (let ((.cse34 (+ v_prenex_4 (* (- 1) .cse35))) (.cse33 (+ v_prenex_4 v_main_~r~0_BEFORE_CALL_42)) (.cse36 (* 3 .cse35))) (and (= 0 (+ (let ((.cse32 (* 4 v_prenex_6))) (+ (* (* .cse32 v_prenex_7) .cse33) (+ (- (* (* v_prenex_7 .cse34) v_prenex_7)) (+ (* v_prenex_7 (* (* 4 v_prenex_5) .cse34)) (+ (- (* (* .cse32 v_prenex_5) v_prenex_7)) (* (* v_prenex_6 v_prenex_6) .cse34)))))) (- (* (* (+ (* 4 v_prenex_4) (* (- 4) .cse35)) v_prenex_7) .cse33)))) (<= 0 v_prenex_7) (<= .cse35 v_prenex_5) (< v_main_~r~0_BEFORE_CALL_42 (+ (* 2 (div .cse34 2)) .cse36)) (= (mod v_prenex_7 4) 0) (= (* v_prenex_7 v_prenex_5) (+ (* .cse34 .cse34) (* .cse33 v_prenex_7))) (< (+ (* 2 .cse35) v_main_~r~0_BEFORE_CALL_42) (+ v_prenex_7 v_prenex_4)) (= (mod .cse36 (- 4)) 0) (= (mod (* 3 (div (- .cse35) (- 4))) (- 4)) 0) (not (= v_prenex_7 1)) (< v_prenex_5 v_prenex_7) (= 0 (mod (+ v_prenex_4 .cse35) 2))))))))) is different from false [2019-09-03 20:20:27,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= 1 c___VERIFIER_assert_~cond))) (or (and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_main_~r~0_BEFORE_CALL_42 Int)) (let ((.cse3 (div v_prenex_7 4))) (let ((.cse2 (+ v_prenex_4 (* (- 1) .cse3))) (.cse1 (+ v_prenex_4 v_main_~r~0_BEFORE_CALL_42)) (.cse4 (* 3 .cse3))) (and (= 0 (+ (let ((.cse0 (* 4 v_prenex_6))) (+ (* (* .cse0 v_prenex_7) .cse1) (+ (- (* (* v_prenex_7 .cse2) v_prenex_7)) (+ (* v_prenex_7 (* (* 4 v_prenex_5) .cse2)) (+ (- (* (* .cse0 v_prenex_5) v_prenex_7)) (* (* v_prenex_6 v_prenex_6) .cse2)))))) (- (* (* (+ (* 4 v_prenex_4) (* (- 4) .cse3)) v_prenex_7) .cse1)))) (<= 0 v_prenex_7) (<= .cse3 v_prenex_5) (< v_main_~r~0_BEFORE_CALL_42 (+ (* 2 (div .cse2 2)) .cse4)) (= (mod v_prenex_7 4) 0) (= (* v_prenex_7 v_prenex_5) (+ (* .cse2 .cse2) (* .cse1 v_prenex_7))) (< (+ (* 2 .cse3) v_main_~r~0_BEFORE_CALL_42) (+ v_prenex_7 v_prenex_4)) (= (mod .cse4 (- 4)) 0) (= (mod (* 3 (div (- .cse3) (- 4))) (- 4)) 0) (not (= v_prenex_7 1)) (< v_prenex_5 v_prenex_7) (= 0 (mod (+ v_prenex_4 .cse3) 2)))))) .cse5) (and (exists ((v_prenex_17 Int) (v_prenex_39 Int) (v_prenex_23 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse6 (div v_prenex_17 4))) (let ((.cse7 (+ v_prenex_23 (* (- 1) .cse6))) (.cse8 (+ v_prenex_39 v_prenex_23)) (.cse9 (* 3 .cse6))) (and (not (= 0 (mod (+ v_prenex_23 .cse6) 2))) (= (mod (* 3 (div (- .cse6) (- 4))) (- 4)) 0) (= (+ (* .cse7 .cse7) (* .cse8 v_prenex_17)) (* v_prenex_17 v_prenex_19)) (< v_prenex_39 (+ .cse9 (* 2 (div .cse7 2)) 2)) (not (= v_prenex_17 1)) (= (mod v_prenex_17 4) 0) (<= .cse6 v_prenex_19) (= 0 (+ (- (* .cse8 (* v_prenex_17 (+ (* 4 v_prenex_23) (* (- 4) .cse6))))) (let ((.cse10 (* 4 v_prenex_21))) (+ (+ (+ (+ (* .cse7 (* v_prenex_21 v_prenex_21)) (- (* (* v_prenex_19 .cse10) v_prenex_17))) (* v_prenex_17 (* .cse7 (* 4 v_prenex_19)))) (- (* (* .cse7 v_prenex_17) v_prenex_17))) (* (* v_prenex_17 .cse10) .cse8))))) (= (mod .cse9 (- 4)) 0) (< v_prenex_23 .cse6) (< v_prenex_19 v_prenex_17) (< (+ v_prenex_39 (* 2 .cse6)) (+ v_prenex_17 v_prenex_23)))))) .cse5) (and .cse5 (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_42 Int)) (let ((.cse14 (div v_prenex_35 4))) (let ((.cse15 (* 3 .cse14)) (.cse13 (+ v_prenex_38 v_prenex_42)) (.cse11 (+ v_prenex_38 (* (- 1) .cse14)))) (and (= 0 (+ (let ((.cse12 (* 4 v_prenex_37))) (+ (+ (- (* (* .cse11 v_prenex_35) v_prenex_35)) (+ (* v_prenex_35 (* .cse11 (* 4 v_prenex_36))) (+ (* (* v_prenex_37 v_prenex_37) .cse11) (- (* v_prenex_35 (* v_prenex_36 .cse12)))))) (* (* v_prenex_35 .cse12) .cse13))) (- (* .cse13 (* (+ (* 4 v_prenex_38) (* (- 4) .cse14)) v_prenex_35))))) (= (mod .cse15 (- 4)) 0) (<= .cse14 v_prenex_36) (< v_prenex_42 (+ (* 2 (div .cse11 2)) .cse15)) (< v_prenex_36 v_prenex_35) (= (+ (* v_prenex_35 .cse13) (* .cse11 .cse11)) (* v_prenex_36 v_prenex_35)) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= (mod (+ v_prenex_38 .cse14) 2) 0) (= (mod v_prenex_35 4) 0) (< (+ v_prenex_42 (* 2 .cse14)) (+ v_prenex_38 v_prenex_35))))))) (and (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_40 Int) (v_prenex_10 Int) (v_prenex_8 Int)) (let ((.cse17 (div v_prenex_10 4))) (let ((.cse16 (+ v_prenex_40 v_prenex_8)) (.cse20 (* 3 .cse17)) (.cse19 (+ (* (- 1) .cse17) v_prenex_8))) (and (= (+ (- (* .cse16 (* (+ (* (- 4) .cse17) (* 4 v_prenex_8)) v_prenex_10))) (let ((.cse18 (* 4 v_prenex_14))) (+ (+ (+ (+ (- (* (* v_prenex_12 .cse18) v_prenex_10)) (* .cse19 (* v_prenex_14 v_prenex_14))) (* (* .cse19 (* 4 v_prenex_12)) v_prenex_10)) (- (* (* .cse19 v_prenex_10) v_prenex_10))) (* .cse16 (* v_prenex_10 .cse18))))) 0) (= (* v_prenex_12 v_prenex_10) (+ (* .cse19 .cse19) (* .cse16 v_prenex_10))) (< v_prenex_12 v_prenex_10) (< (+ (* 2 .cse17) v_prenex_40) (+ v_prenex_10 v_prenex_8)) (< v_prenex_8 .cse17) (= (mod .cse20 (- 4)) 0) (< v_prenex_40 (+ .cse20 (* 2 (div .cse19 2)) 2)) (<= 0 v_prenex_10) (<= .cse17 v_prenex_12) (= (mod v_prenex_10 4) 0) (not (= (mod (+ .cse17 v_prenex_8) 2) 0)) (= (mod (* 3 (div (- .cse17) (- 4))) (- 4)) 0) (not (= v_prenex_10 1)))))) .cse5) .cse5)) is different from false [2019-09-03 20:20:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 12 refuted. 1 times theorem prover too weak. 22 trivial. 15 not checked. [2019-09-03 20:20:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-03 20:20:28,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:20:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:20:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=80, Unknown=27, NotChecked=150, Total=306 [2019-09-03 20:20:28,027 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand 18 states. [2019-09-03 20:21:55,447 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse0 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse0) (- 4)) 0) (= (+ (let ((.cse1 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse1 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse1 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse0 main_~n~0) (= (mod (* 3 (div (- .cse0) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0)))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2019-09-03 20:21:57,456 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse0 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse0) (- 4)) 0) (= (+ (let ((.cse1 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse1 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse1 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse0 main_~n~0) (= (mod (* 3 (div (- .cse0) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0))))) is different from false [2019-09-03 20:21:59,460 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (exists ((main_~h~0 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse0 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse0) (- 4)) 0) (= (+ (let ((.cse1 (* 4 main_~h~0))) (+ (* v_main_~r~0_BEFORE_CALL_41 (* .cse1 v_main_~q~0_BEFORE_CALL_43)) (+ (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44))) (+ (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44)) (+ (* (* main_~h~0 main_~h~0) v_main_~p~0_BEFORE_CALL_44) (- (* (* .cse1 main_~n~0) v_main_~q~0_BEFORE_CALL_43))))))) (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44))))) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse0 main_~n~0) (= (mod (* 3 (div (- .cse0) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0))))) is different from true [2019-09-03 20:22:07,529 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse33 (+ v_prenex_4 (* (- 1) c_main_~q~0))) (.cse32 (+ v_prenex_4 c_main_~r~0)) (.cse34 (div v_prenex_7 4))) (and (<= 0 v_prenex_7) (= (* v_prenex_7 v_prenex_5) (+ (* .cse32 v_prenex_7) (* .cse33 .cse33))) (= (mod v_prenex_7 4) 0) (not (= v_prenex_7 1)) (= .cse34 c_main_~q~0) (= c_main_~p~0 (+ (div (+ v_prenex_4 (- c_main_~q~0)) 2) c_main_~q~0)) (= (+ (- (* .cse32 (* (+ (* 4 v_prenex_4) (* (- 4) c_main_~q~0)) v_prenex_7))) (let ((.cse35 (* 4 v_prenex_6))) (+ (+ (- (* (* .cse33 v_prenex_7) v_prenex_7)) (+ (* v_prenex_7 (* (* 4 v_prenex_5) .cse33)) (+ (* (* v_prenex_6 v_prenex_6) .cse33) (- (* (* .cse35 v_prenex_5) v_prenex_7))))) (* (* .cse35 v_prenex_7) .cse32)))) 0) (= 0 (mod (+ v_prenex_4 c_main_~q~0) 2)) (<= .cse34 v_prenex_5) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_7 v_prenex_4)) (= (mod (* 3 .cse34) (- 4)) 0) (= (mod (* 3 (div (- .cse34) (- 4))) (- 4)) 0) (< v_prenex_5 v_prenex_7))))) (.cse3 (and (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_31 Int)) (let ((.cse26 (div v_prenex_27 4))) (and (= (mod v_prenex_27 4) 0) (= (mod (* 3 .cse26) (- 4)) 0) (= (mod (* 3 (div (- .cse26) (- 4))) (- 4)) 0) (= 0 (+ (- (* v_prenex_31 (* (* 4 v_prenex_34) v_prenex_27))) (let ((.cse27 (* 4 v_prenex_29))) (+ (+ (+ (+ (* (* v_prenex_29 v_prenex_29) v_prenex_34) (- (* (* v_prenex_33 .cse27) v_prenex_27))) (* (* v_prenex_34 (* 4 v_prenex_33)) v_prenex_27)) (- (* v_prenex_27 (* v_prenex_34 v_prenex_27)))) (* v_prenex_31 (* v_prenex_27 .cse27)))))) (< v_prenex_33 v_prenex_27) (< v_prenex_31 (+ v_prenex_27 (* 2 v_prenex_34))) (= (+ (* v_prenex_34 v_prenex_34) (* v_prenex_31 v_prenex_27)) (* v_prenex_33 v_prenex_27)) (<= .cse26 v_prenex_33)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_32 Int)) (let ((.cse28 (div v_prenex_26 4)) (.cse30 (+ v_prenex_32 (* (- 1) c_main_~q~0))) (.cse29 (+ v_prenex_32 c_main_~r~0))) (and (< v_prenex_28 v_prenex_26) (not (= v_prenex_26 1)) (<= c_main_~q~0 v_prenex_32) (= c_main_~p~0 (+ (div (+ v_prenex_32 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse28) (- 4))) (- 4)) 0) (= (mod v_prenex_26 4) 0) (= (+ (* .cse29 v_prenex_26) (* .cse30 .cse30)) (* v_prenex_28 v_prenex_26)) (<= .cse28 v_prenex_28) (= (mod (* 3 .cse28) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_26 v_prenex_32)) (= .cse28 c_main_~q~0) (= 0 (+ (let ((.cse31 (* 4 v_prenex_30))) (+ (+ (+ (+ (- (* v_prenex_26 (* .cse31 v_prenex_28))) (* .cse30 (* v_prenex_30 v_prenex_30))) (* v_prenex_26 (* .cse30 (* 4 v_prenex_28)))) (- (* (* .cse30 v_prenex_26) v_prenex_26))) (* .cse29 (* .cse31 v_prenex_26)))) (- (* (* v_prenex_26 (+ (* 4 v_prenex_32) (* (- 4) c_main_~q~0))) .cse29))))))))) (.cse4 (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse22 (div v_prenex_35 4)) (.cse23 (+ v_prenex_38 (* (- 1) c_main_~q~0))) (.cse24 (+ v_prenex_38 c_main_~r~0))) (and (= (mod (* 3 .cse22) (- 4)) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_38 v_prenex_35)) (<= .cse22 v_prenex_36) (= .cse22 c_main_~q~0) (= 0 (mod (+ v_prenex_38 c_main_~q~0) 2)) (= (+ (* .cse23 .cse23) (* .cse24 v_prenex_35)) (* v_prenex_36 v_prenex_35)) (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_38 (- c_main_~q~0)) 2))) (< v_prenex_36 v_prenex_35) (= (mod (* 3 (div (- .cse22) (- 4))) (- 4)) 0) (not (= v_prenex_35 1)) (= 0 (+ (- (* (* v_prenex_35 (+ (* 4 v_prenex_38) (* (- 4) c_main_~q~0))) .cse24)) (let ((.cse25 (* 4 v_prenex_37))) (+ (+ (- (* v_prenex_35 (* .cse23 v_prenex_35))) (+ (* v_prenex_35 (* .cse23 (* 4 v_prenex_36))) (+ (- (* v_prenex_35 (* v_prenex_36 .cse25))) (* (* v_prenex_37 v_prenex_37) .cse23)))) (* .cse24 (* v_prenex_35 .cse25)))))) (= (mod v_prenex_35 4) 0))))) (.cse0 (exists ((v_prenex_17 Int) (v_prenex_23 Int) (v_prenex_21 Int) (v_prenex_19 Int)) (let ((.cse18 (div v_prenex_17 4)) (.cse19 (+ v_prenex_23 (* (- 1) c_main_~q~0))) (.cse20 (+ v_prenex_23 c_main_~r~0))) (and (= c_main_~p~0 (+ c_main_~q~0 (div (+ v_prenex_23 (- c_main_~q~0)) 2) 1)) (= (mod v_prenex_17 4) 0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_17 v_prenex_23)) (<= .cse18 v_prenex_19) (= (* v_prenex_17 v_prenex_19) (+ (* .cse19 .cse19) (* .cse20 v_prenex_17))) (not (= 0 (mod (+ v_prenex_23 c_main_~q~0) 2))) (= .cse18 c_main_~q~0) (= (mod (* 3 (div (- .cse18) (- 4))) (- 4)) 0) (not (= v_prenex_17 1)) (= (mod (* 3 .cse18) (- 4)) 0) (< v_prenex_19 v_prenex_17) (= (+ (let ((.cse21 (* 4 v_prenex_21))) (+ (+ (+ (* (* .cse19 (* 4 v_prenex_19)) v_prenex_17) (+ (* (* v_prenex_21 v_prenex_21) .cse19) (- (* (* v_prenex_19 .cse21) v_prenex_17)))) (- (* v_prenex_17 (* v_prenex_17 .cse19)))) (* (* v_prenex_17 .cse21) .cse20))) (- (* .cse20 (* v_prenex_17 (+ (* 4 v_prenex_23) (* (- 4) c_main_~q~0)))))) 0) (< v_prenex_23 c_main_~q~0))))) (.cse8 (exists ((main_~h~0 Int) (v_prenex_2 Int) (v_prenex_1 Int) (v_main_~q~0_38 Int)) (let ((.cse14 (div v_main_~q~0_38 4)) (.cse15 (+ main_~h~0 c_main_~r~0)) (.cse16 (+ main_~h~0 (* (- 1) c_main_~q~0)))) (and (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ main_~h~0 v_main_~q~0_38)) (= c_main_~p~0 (+ (div (+ main_~h~0 (- c_main_~q~0)) 2) c_main_~q~0)) (= (mod (* 3 (div (- .cse14) (- 4))) (- 4)) 0) (= (+ (* v_main_~q~0_38 .cse15) (* .cse16 .cse16)) (* v_main_~q~0_38 v_prenex_2)) (= (mod (* 3 .cse14) (- 4)) 0) (= .cse14 c_main_~q~0) (= (mod v_main_~q~0_38 4) 0) (<= .cse14 v_prenex_2) (<= c_main_~q~0 main_~h~0) (= (+ (- (* (* v_main_~q~0_38 (+ (* 4 main_~h~0) (* (- 4) c_main_~q~0))) .cse15)) (let ((.cse17 (* 4 v_prenex_1))) (+ (* (* v_main_~q~0_38 .cse17) .cse15) (+ (- (* v_main_~q~0_38 (* v_main_~q~0_38 .cse16))) (+ (* (* .cse16 (* 4 v_prenex_2)) v_main_~q~0_38) (+ (* .cse16 (* v_prenex_1 v_prenex_1)) (- (* (* .cse17 v_prenex_2) v_main_~q~0_38)))))))) 0) (< v_prenex_2 v_main_~q~0_38) (not (= v_main_~q~0_38 1)) (<= 0 v_main_~q~0_38))))) (.cse9 (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_10 Int) (v_prenex_8 Int)) (let ((.cse10 (div v_prenex_10 4)) (.cse13 (+ (* (- 1) c_main_~q~0) v_prenex_8)) (.cse11 (+ c_main_~r~0 v_prenex_8))) (and (= c_main_~p~0 (+ (div (+ v_prenex_8 (- c_main_~q~0)) 2) c_main_~q~0 1)) (< v_prenex_12 v_prenex_10) (= (mod (* 3 .cse10) (- 4)) 0) (= .cse10 c_main_~q~0) (<= 0 v_prenex_10) (= (+ (let ((.cse12 (* 4 v_prenex_14))) (+ (* .cse11 (* v_prenex_10 .cse12)) (+ (- (* (* .cse13 v_prenex_10) v_prenex_10)) (+ (* (* .cse13 (* 4 v_prenex_12)) v_prenex_10) (+ (- (* (* v_prenex_12 .cse12) v_prenex_10)) (* .cse13 (* v_prenex_14 v_prenex_14))))))) (- (* .cse11 (* v_prenex_10 (+ (* (- 4) c_main_~q~0) (* 4 v_prenex_8)))))) 0) (<= .cse10 v_prenex_12) (= (mod v_prenex_10 4) 0) (= (mod (* 3 (div (- .cse10) (- 4))) (- 4)) 0) (< v_prenex_8 c_main_~q~0) (< (+ (* 2 c_main_~q~0) c_main_~r~0) (+ v_prenex_10 v_prenex_8)) (not (= 0 (mod (+ v_prenex_8 c_main_~q~0) 2))) (= (* v_prenex_12 v_prenex_10) (+ (* .cse13 .cse13) (* .cse11 v_prenex_10))) (not (= v_prenex_10 1))))))) (and (or (and .cse0 (exists ((v_prenex_18 Int) (v_prenex_22 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_20 Int)) (let ((.cse2 (div v_prenex_18 4))) (and (= 0 (+ (- (* (* v_prenex_18 (* 4 v_prenex_25)) v_prenex_22)) (let ((.cse1 (* 4 v_prenex_20))) (+ (+ (+ (+ (* (* v_prenex_20 v_prenex_20) v_prenex_25) (- (* (* v_prenex_24 .cse1) v_prenex_18))) (* v_prenex_18 (* v_prenex_25 (* 4 v_prenex_24)))) (- (* (* v_prenex_18 v_prenex_25) v_prenex_18))) (* (* v_prenex_18 .cse1) v_prenex_22))))) (= (+ (* v_prenex_18 v_prenex_22) (* v_prenex_25 v_prenex_25)) (* v_prenex_18 v_prenex_24)) (= (mod v_prenex_18 4) 0) (< v_prenex_24 v_prenex_18) (<= .cse2 v_prenex_24) (= (mod (* 3 (div (- .cse2) (- 4))) (- 4)) 0) (= (mod (* 3 .cse2) (- 4)) 0) (< v_prenex_22 (+ v_prenex_18 (* 2 v_prenex_25))))))) .cse3 .cse4 (and .cse5 (exists ((v_prenex_3 Int) (main_~n~0 Int) (v_main_~r~0_BEFORE_CALL_41 Int) (v_main_~p~0_BEFORE_CALL_44 Int) (v_main_~q~0_BEFORE_CALL_43 Int)) (let ((.cse7 (div v_main_~q~0_BEFORE_CALL_43 4))) (and (= (+ (- (* v_main_~r~0_BEFORE_CALL_41 (* v_main_~q~0_BEFORE_CALL_43 (* 4 v_main_~p~0_BEFORE_CALL_44)))) (let ((.cse6 (* 4 v_prenex_3))) (+ (+ (+ (+ (- (* (* .cse6 main_~n~0) v_main_~q~0_BEFORE_CALL_43)) (* v_main_~p~0_BEFORE_CALL_44 (* v_prenex_3 v_prenex_3))) (* v_main_~q~0_BEFORE_CALL_43 (* (* 4 main_~n~0) v_main_~p~0_BEFORE_CALL_44))) (- (* v_main_~q~0_BEFORE_CALL_43 (* v_main_~q~0_BEFORE_CALL_43 v_main_~p~0_BEFORE_CALL_44)))) (* v_main_~r~0_BEFORE_CALL_41 (* .cse6 v_main_~q~0_BEFORE_CALL_43))))) 0) (< v_main_~r~0_BEFORE_CALL_41 (+ (* 2 v_main_~p~0_BEFORE_CALL_44) v_main_~q~0_BEFORE_CALL_43)) (= (mod (* 3 .cse7) (- 4)) 0) (= (+ (* v_main_~r~0_BEFORE_CALL_41 v_main_~q~0_BEFORE_CALL_43) (* v_main_~p~0_BEFORE_CALL_44 v_main_~p~0_BEFORE_CALL_44)) (* v_main_~q~0_BEFORE_CALL_43 main_~n~0)) (< main_~n~0 v_main_~q~0_BEFORE_CALL_43) (<= .cse7 main_~n~0) (= (mod (* 3 (div (- .cse7) (- 4))) (- 4)) 0) (= (mod v_main_~q~0_BEFORE_CALL_43 4) 0))))) .cse8 .cse9) (or .cse5 .cse3 .cse4 .cse0 .cse8 .cse9))) is different from false [2019-09-03 20:22:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:22:11,355 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2019-09-03 20:22:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:22:11,361 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2019-09-03 20:22:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:22:11,363 INFO L225 Difference]: With dead ends: 130 [2019-09-03 20:22:11,363 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:22:11,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 141.3s TimeCoverageRelationStatistics Valid=64, Invalid=122, Unknown=32, NotChecked=288, Total=506 [2019-09-03 20:22:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:22:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 20:22:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:22:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2019-09-03 20:22:11,383 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 51 [2019-09-03 20:22:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:22:11,384 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2019-09-03 20:22:11,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:22:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2019-09-03 20:22:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:22:11,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:22:11,386 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:22:11,387 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:22:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:22:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1195523203, now seen corresponding path program 5 times [2019-09-03 20:22:11,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:22:11,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:22:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:22:11,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:22:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:22:11,413 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:22:11,413 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:22:11,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:22:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1